Base | Representation |
---|---|
bin | 11101101100101001011… |
… | …00110000111101111001 |
3 | 10121112211120102000120001 |
4 | 32312110230300331321 |
5 | 113204240403341100 |
6 | 2100433300233001 |
7 | 133502340664444 |
oct | 16662454607571 |
9 | 3545746360501 |
10 | 1020402012025 |
11 | 363828374560 |
12 | 14591669b761 |
13 | 752ba03a7c6 |
14 | 3755dc9865b |
15 | 1b822941d6a |
hex | ed94b30f79 |
1020402012025 has 12 divisors (see below), whose sum is σ = 1380325631184. Its totient is φ = 742110554000.
The previous prime is 1020402011989. The next prime is 1020402012067. The reversal of 1020402012025 is 5202102040201.
It is not a de Polignac number, because 1020402012025 - 215 = 1020401979257 is a prime.
It is a super-2 number, since 2×10204020120252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020402011993 and 1020402012011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1855276111 + ... + 1855276660.
It is an arithmetic number, because the mean of its divisors is an integer number (115027135932).
Almost surely, 21020402012025 is an apocalyptic number.
It is an amenable number.
1020402012025 is a deficient number, since it is larger than the sum of its proper divisors (359923619159).
1020402012025 is a wasteful number, since it uses less digits than its factorization.
1020402012025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3710552792 (or 3710552787 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 19.
Adding to 1020402012025 its reverse (5202102040201), we get a palindrome (6222504052226).
The spelling of 1020402012025 in words is "one trillion, twenty billion, four hundred two million, twelve thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •