Base | Representation |
---|---|
bin | 11101110001111010000… |
… | …01111101100111000101 |
3 | 10121211010101111122101010 |
4 | 32320331001331213011 |
5 | 113231031343004000 |
6 | 2102021423152433 |
7 | 133632332460126 |
oct | 16707501754705 |
9 | 3554111448333 |
10 | 1023226141125 |
11 | 364a47532551 |
12 | 146384445719 |
13 | 7564a165706 |
14 | 3774ada004d |
15 | 1b93a845d50 |
hex | ee3d07d9c5 |
1023226141125 has 64 divisors (see below), whose sum is σ = 1759927762944. Its totient is φ = 527409000000.
The previous prime is 1023226141121. The next prime is 1023226141163. The reversal of 1023226141125 is 5211416223201.
It is not a de Polignac number, because 1023226141125 - 22 = 1023226141121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1023226141092 and 1023226141101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023226141121) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 8671774 + ... + 8788976.
It is an arithmetic number, because the mean of its divisors is an integer number (27498871296).
Almost surely, 21023226141125 is an apocalyptic number.
1023226141125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1023226141125 is a deficient number, since it is larger than the sum of its proper divisors (736701621819).
1023226141125 is a wasteful number, since it uses less digits than its factorization.
1023226141125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118003 (or 117993 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 1023226141125 in words is "one trillion, twenty-three billion, two hundred twenty-six million, one hundred forty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •