Base | Representation |
---|---|
bin | 11011000111001101… |
… | …11100010111100010 |
3 | 1101120102210012122112 |
4 | 31203212330113202 |
5 | 214302322230020 |
6 | 10404214435322 |
7 | 1023466266110 |
oct | 154346742742 |
9 | 41512705575 |
10 | 14556055010 |
11 | 619a571632 |
12 | 29a2962b42 |
13 | 14ac88c403 |
14 | 9c12a0ab0 |
15 | 5a2d702c5 |
hex | 3639bc5e2 |
14556055010 has 64 divisors (see below), whose sum is σ = 31771657728. Its totient is φ = 4687248384.
The previous prime is 14556054977. The next prime is 14556055037. The reversal of 14556055010 is 1055065541.
It is a super-2 number, since 2×145560550102 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 566972 + ... + 592088.
It is an arithmetic number, because the mean of its divisors is an integer number (496432152).
Almost surely, 214556055010 is an apocalyptic number.
14556055010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14556055010 is an abundant number, since it is smaller than the sum of its proper divisors (17215602718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14556055010 is a wasteful number, since it uses less digits than its factorization.
14556055010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25635.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 14556055010 in words is "fourteen billion, five hundred fifty-six million, fifty-five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •