Base | Representation |
---|---|
bin | 11101100010100111111… |
… | …100001000011111110001 |
3 | 21012001220010101210011121 |
4 | 131202213330020133301 |
5 | 231230011240402400 |
6 | 4152331035542241 |
7 | 266444223221155 |
oct | 35424774103761 |
9 | 7161803353147 |
10 | 2030042122225 |
11 | 712a32944977 |
12 | 289528bba981 |
13 | 119580586c60 |
14 | 7037c741065 |
15 | 37c1567721a |
hex | 1d8a7f087f1 |
2030042122225 has 48 divisors (see below), whose sum is σ = 2715871312000. Its totient is φ = 1496354757120.
The previous prime is 2030042122217. The next prime is 2030042122231. The reversal of 2030042122225 is 5222212400302.
It is not a de Polignac number, because 2030042122225 - 23 = 2030042122217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 2030042122225.
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 47 ways as a sum of consecutive naturals, for example, 570394996 + ... + 570398554.
Almost surely, 22030042122225 is an apocalyptic number.
2030042122225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2030042122225 is a deficient number, since it is larger than the sum of its proper divisors (685829189775).
2030042122225 is a wasteful number, since it uses less digits than its factorization.
2030042122225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6314 (or 6309 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 25.
Adding to 2030042122225 its reverse (5222212400302), we get a palindrome (7252254522527).
The spelling of 2030042122225 in words is "two trillion, thirty billion, forty-two million, one hundred twenty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •