Base | Representation |
---|---|
bin | 1001001011111011011111… |
… | …0101101111000111011010 |
3 | 1022202121021212100221122000 |
4 | 2102332313311233013122 |
5 | 2310441412410230132 |
6 | 33252044004341430 |
7 | 2061512051035104 |
oct | 222766765570732 |
9 | 38677255327560 |
10 | 10100552430042 |
11 | 3244690586a78 |
12 | 117167a6a4876 |
13 | 58362a249539 |
14 | 26cc256b2574 |
15 | 127b1290087c |
hex | 92fb7d6f1da |
10100552430042 has 32 divisors (see below), whose sum is σ = 22813633911360. Its totient is φ = 3311656533360.
The previous prime is 10100552430037. The next prime is 10100552430061. The reversal of 10100552430042 is 24003425500101.
10100552430042 is a `hidden beast` number, since 1 + 0 + 100 + 5 + 524 + 30 + 0 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10100552429988 and 10100552430015.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1533171028 + ... + 1533177615.
It is an arithmetic number, because the mean of its divisors is an integer number (712926059730).
Almost surely, 210100552430042 is an apocalyptic number.
10100552430042 is an abundant number, since it is smaller than the sum of its proper divisors (12713081481318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100552430042 is a wasteful number, since it uses less digits than its factorization.
10100552430042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3066348715 (or 3066348709 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 10100552430042 its reverse (24003425500101), we get a palindrome (34103977930143).
The spelling of 10100552430042 in words is "ten trillion, one hundred billion, five hundred fifty-two million, four hundred thirty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •