Base | Representation |
---|---|
bin | 100000010010110100010000… |
… | …000100000100100111001001 |
3 | 200121212222122202011021120210 |
4 | 200102310100010010213021 |
5 | 122104012023002424340 |
6 | 1222023533010511333 |
7 | 41626240155111156 |
oct | 4022642004044711 |
9 | 617788582137523 |
10 | 142030543014345 |
11 | 412898a6891847 |
12 | 13b1a579595549 |
13 | 61335659a280b |
14 | 271045a37722d |
15 | 1164818b06180 |
hex | 812d101049c9 |
142030543014345 has 8 divisors (see below), whose sum is σ = 227248868822976. Its totient is φ = 75749622940976.
The previous prime is 142030543014323. The next prime is 142030543014391. The reversal of 142030543014345 is 543410345030241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142030543014345 - 26 = 142030543014281 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4734351433797 + ... + 4734351433826.
It is an arithmetic number, because the mean of its divisors is an integer number (28406108602872).
Almost surely, 2142030543014345 is an apocalyptic number.
142030543014345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142030543014345 is a deficient number, since it is larger than the sum of its proper divisors (85218325808631).
142030543014345 is an equidigital number, since it uses as much as digits as its factorization.
142030543014345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9468702867631.
The product of its (nonzero) digits is 345600, while the sum is 39.
Adding to 142030543014345 its reverse (543410345030241), we get a palindrome (685440888044586).
The spelling of 142030543014345 in words is "one hundred forty-two trillion, thirty billion, five hundred forty-three million, fourteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •