Base | Representation |
---|---|
bin | 1001100110110001001101… |
… | …10111011100011000101101 |
3 | 2202210100221011220102000122 |
4 | 10303120212313130120231 |
5 | 10232041010103331000 |
6 | 112531524405534325 |
7 | 4310052044650643 |
oct | 463304667343055 |
9 | 82710834812018 |
10 | 21123301230125 |
11 | 6804383952106 |
12 | 2451a06a143a5 |
13 | ba2bc3689b33 |
14 | 530532227193 |
15 | 2696eb2ea085 |
hex | 133626ddc62d |
21123301230125 has 32 divisors (see below), whose sum is σ = 27556722585600. Its totient is φ = 16146516672000.
The previous prime is 21123301230091. The next prime is 21123301230131. The reversal of 21123301230125 is 52103210332112.
It is not a de Polignac number, because 21123301230125 - 28 = 21123301229869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21123301230094 and 21123301230103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34194980 + ... + 34807229.
It is an arithmetic number, because the mean of its divisors is an integer number (861147580800).
Almost surely, 221123301230125 is an apocalyptic number.
21123301230125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21123301230125 is a deficient number, since it is larger than the sum of its proper divisors (6433421355475).
21123301230125 is an equidigital number, since it uses as much as digits as its factorization.
21123301230125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69002334 (or 69002324 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 21123301230125 its reverse (52103210332112), we get a palindrome (73226511562237).
The spelling of 21123301230125 in words is "twenty-one trillion, one hundred twenty-three billion, three hundred one million, two hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •