Base | Representation |
---|---|
bin | 11101101101111111011… |
… | …11000011111001001101 |
3 | 10121121200220000112200022 |
4 | 32312333233003321031 |
5 | 113212230223043000 |
6 | 2101033051511525 |
7 | 133526256036236 |
oct | 16667757037115 |
9 | 3547626015608 |
10 | 1021124034125 |
11 | 364068995438 |
12 | 145a984585a5 |
13 | 753a37ba810 |
14 | 375cbb2608d |
15 | 1b866014585 |
hex | edbfbc3e4d |
1021124034125 has 16 divisors (see below), whose sum is σ = 1372390704048. Its totient is φ = 754060824000.
The previous prime is 1021124034109. The next prime is 1021124034137. The reversal of 1021124034125 is 5214304211201.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 814351027396 + 206773006729 = 902414^2 + 454723^2 .
It is not a de Polignac number, because 1021124034125 - 24 = 1021124034109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021124034094 and 1021124034103.
It is a congruent number.
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, 314190386 + ... + 314193635.
It is an arithmetic number, because the mean of its divisors is an integer number (85774419003).
Almost surely, 21021124034125 is an apocalyptic number.
It is an amenable number.
1021124034125 is a deficient number, since it is larger than the sum of its proper divisors (351266669923).
1021124034125 is an equidigital number, since it uses as much as digits as its factorization.
1021124034125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628384049 (or 628384039 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 1021124034125 its reverse (5214304211201), we get a palindrome (6235428245326).
The spelling of 1021124034125 in words is "one trillion, twenty-one billion, one hundred twenty-four million, thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •