Base | Representation |
---|---|
bin | 11011000110100010… |
… | …01100110010010100 |
3 | 1101120001001121211110 |
4 | 31203101030302110 |
5 | 214244342330332 |
6 | 10403452335020 |
7 | 1023366656220 |
oct | 154321146224 |
9 | 41501047743 |
10 | 14550355092 |
11 | 6197329159 |
12 | 29a0a74470 |
13 | 14ab644b90 |
14 | 9c0619780 |
15 | 5a25e64cc |
hex | 36344cc94 |
14550355092 has 96 divisors (see below), whose sum is σ = 42494054400. Its totient is φ = 3772397952.
The previous prime is 14550355091. The next prime is 14550355111. The reversal of 14550355092 is 29055305541.
It is a super-3 number, since 3×145503550923 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 14550355092.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14550355091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48492 + ... + 177347.
It is an arithmetic number, because the mean of its divisors is an integer number (442646400).
Almost surely, 214550355092 is an apocalyptic number.
14550355092 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14550355092 is an abundant number, since it is smaller than the sum of its proper divisors (27943699308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14550355092 is a wasteful number, since it uses less digits than its factorization.
14550355092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225925 (or 225923 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 14550355092 in words is "fourteen billion, five hundred fifty million, three hundred fifty-five thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •