Base | Representation |
---|---|
bin | 11011010000000001… |
… | …10000100000110010 |
3 | 1101202120210111112110 |
4 | 31220000300200302 |
5 | 214430230243213 |
6 | 10415414110150 |
7 | 1025354235141 |
oct | 155000604062 |
9 | 41676714473 |
10 | 14629931058 |
11 | 622823a816 |
12 | 2a0364b356 |
13 | 14c1c87252 |
14 | 9cb011758 |
15 | 5a95b45c3 |
hex | 368030832 |
14629931058 has 16 divisors (see below), whose sum is σ = 29284239456. Its totient is φ = 4872580800.
The previous prime is 14629931051. The next prime is 14629931081. The reversal of 14629931058 is 85013992641.
It is a junction number, because it is equal to n+sod(n) for n = 14629930998 and 14629931016.
It is not an unprimeable number, because it can be changed into a prime (14629931051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1007916 + ... + 1022327.
It is an arithmetic number, because the mean of its divisors is an integer number (1830264966).
Almost surely, 214629931058 is an apocalyptic number.
14629931058 is an abundant number, since it is smaller than the sum of its proper divisors (14654308398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14629931058 is a wasteful number, since it uses less digits than its factorization.
14629931058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031449.
The product of its (nonzero) digits is 466560, while the sum is 48.
The spelling of 14629931058 in words is "fourteen billion, six hundred twenty-nine million, nine hundred thirty-one thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •