Base | Representation |
---|---|
bin | 11101011101111011111… |
… | …01001010101110110101 |
3 | 10120210110011100210100210 |
4 | 32232331331022232311 |
5 | 113042102041240000 |
6 | 2053045451500033 |
7 | 133102541031234 |
oct | 16567575125665 |
9 | 3523404323323 |
10 | 1012504243125 |
11 | 360445281921 |
12 | 144291757619 |
13 | 7462ba3c87b |
14 | 37011002b1b |
15 | 1b50e3dc350 |
hex | ebbdf4abb5 |
1012504243125 has 80 divisors (see below), whose sum is σ = 1786988630592. Its totient is φ = 508013184000.
The previous prime is 1012504243111. The next prime is 1012504243129. The reversal of 1012504243125 is 5213424052101.
It is not a de Polignac number, because 1012504243125 - 221 = 1012502145973 is a prime.
It is a super-2 number, since 2×10125042431252 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012504243092 and 1012504243101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012504243129) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 90615039 + ... + 90626211.
Almost surely, 21012504243125 is an apocalyptic number.
1012504243125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1012504243125 is a deficient number, since it is larger than the sum of its proper divisors (774484387467).
1012504243125 is a wasteful number, since it uses less digits than its factorization.
1012504243125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14056 (or 14041 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 1012504243125 its reverse (5213424052101), we get a palindrome (6225928295226).
The spelling of 1012504243125 in words is "one trillion, twelve billion, five hundred four million, two hundred forty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •