Base | Representation |
---|---|
bin | 100000010010111000111010… |
… | …101001110010010001111111 |
3 | 200121220110120212102002020202 |
4 | 200102320322221302101333 |
5 | 122104102302420323403 |
6 | 1222030122041434115 |
7 | 41626505254121036 |
oct | 4022707251622177 |
9 | 617813525362222 |
10 | 142035552511103 |
11 | 41290a37595909 |
12 | 13b1b53719b93b |
13 | 6133b837a7b94 |
14 | 27107b37cb71d |
15 | 1164a0d7d6688 |
hex | 812e3aa7247f |
142035552511103 has 8 divisors (see below), whose sum is σ = 144062114088960. Its totient is φ = 140009714845560.
The previous prime is 142035552511091. The next prime is 142035552511141. The reversal of 142035552511103 is 301115255530241.
142035552511103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 142035552511103 - 24 = 142035552511087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142035552511163) 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, 180582863 + ... + 181367696.
It is an arithmetic number, because the mean of its divisors is an integer number (18007764261120).
Almost surely, 2142035552511103 is an apocalyptic number.
142035552511103 is a deficient number, since it is larger than the sum of its proper divisors (2026561577857).
142035552511103 is an equidigital number, since it uses as much as digits as its factorization.
142035552511103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361956157.
The product of its (nonzero) digits is 90000, while the sum is 38.
The spelling of 142035552511103 in words is "one hundred forty-two trillion, thirty-five billion, five hundred fifty-two million, five hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •