Base | Representation |
---|---|
bin | 1101000011100001010001… |
… | …1110111011000111111010 |
3 | 1212211020111121101001020220 |
4 | 3100320110132323013322 |
5 | 3340134221313312132 |
6 | 50310105501000510 |
7 | 3011023403606454 |
oct | 320702436730772 |
9 | 55736447331226 |
10 | 14354124354042 |
11 | 4634605a941a0 |
12 | 1739b13253136 |
13 | 801785133945 |
14 | 378a599852d4 |
15 | 19d5b508ca2c |
hex | d0e147bb1fa |
14354124354042 has 64 divisors (see below), whose sum is σ = 32178034888704. Its totient is φ = 4230396555840.
The previous prime is 14354124354029. The next prime is 14354124354107. The reversal of 14354124354042 is 24045342145341.
It is a junction number, because it is equal to n+sod(n) for n = 14354124353985 and 14354124354003.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4585963 + ... + 7052609.
It is an arithmetic number, because the mean of its divisors is an integer number (502781795136).
Almost surely, 214354124354042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14354124354042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16089017444352).
14354124354042 is an abundant number, since it is smaller than the sum of its proper divisors (17823910534662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14354124354042 is a wasteful number, since it uses less digits than its factorization.
14354124354042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2469083.
The product of its (nonzero) digits is 921600, while the sum is 42.
Adding to 14354124354042 its reverse (24045342145341), we get a palindrome (38399466499383).
The spelling of 14354124354042 in words is "fourteen trillion, three hundred fifty-four billion, one hundred twenty-four million, three hundred fifty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •