Base | Representation |
---|---|
bin | 1100101111000101101001… |
… | …0001110111000100110000 |
3 | 1211120200110200012112210020 |
4 | 3023301122101313010300 |
5 | 3313411331123011212 |
6 | 45440534454403440 |
7 | 2643456033144003 |
oct | 313613221670460 |
9 | 54520420175706 |
10 | 14003108016432 |
11 | 4509759462407 |
12 | 16a1a90660580 |
13 | 7a7644b27a22 |
14 | 365a7b15153a |
15 | 1943bdbcbd8c |
hex | cbc5a477130 |
14003108016432 has 40 divisors (see below), whose sum is σ = 36197012193840. Its totient is φ = 4664823125760.
The previous prime is 14003108016431. The next prime is 14003108016439. The reversal of 14003108016432 is 23461080130041.
It is a junction number, because it is equal to n+sod(n) for n = 14003108016393 and 14003108016402.
It is not an unprimeable number, because it can be changed into a prime (14003108016431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89907207 + ... + 90062822.
It is an arithmetic number, because the mean of its divisors is an integer number (904925304846).
Almost surely, 214003108016432 is an apocalyptic number.
14003108016432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14003108016432 is an abundant number, since it is smaller than the sum of its proper divisors (22193904177408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14003108016432 is a wasteful number, since it uses less digits than its factorization.
14003108016432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179971661 (or 179971655 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 33.
Adding to 14003108016432 its reverse (23461080130041), we get a palindrome (37464188146473).
The spelling of 14003108016432 in words is "fourteen trillion, three billion, one hundred eight million, sixteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •