Base | Representation |
---|---|
bin | 11101110101100101011… |
… | …11100000100110111001 |
3 | 10122000020000120122100022 |
4 | 32322302233200212321 |
5 | 113244102424441400 |
6 | 2102545411420225 |
7 | 134032302563432 |
oct | 16726257404671 |
9 | 3560200518308 |
10 | 1025201015225 |
11 | 365870278702 |
12 | 1468358b4675 |
13 | 758a335347a |
14 | 37897398489 |
15 | 1ba03de3b85 |
hex | eeb2be09b9 |
1025201015225 has 24 divisors (see below), whose sum is σ = 1302936076992. Its totient is φ = 799779960000.
The previous prime is 1025201015219. The next prime is 1025201015231. The reversal of 1025201015225 is 5225101025201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1025201015219) and next prime (1025201015231).
It is not a de Polignac number, because 1025201015225 - 214 = 1025200998841 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1025201015194 and 1025201015203.
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 23 ways as a sum of consecutive naturals, for example, 118901 + ... + 1436850.
It is an arithmetic number, because the mean of its divisors is an integer number (54289003208).
Almost surely, 21025201015225 is an apocalyptic number.
It is an amenable number.
1025201015225 is a deficient number, since it is larger than the sum of its proper divisors (277735061767).
1025201015225 is a wasteful number, since it uses less digits than its factorization.
1025201015225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1556417 (or 1556412 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
The spelling of 1025201015225 in words is "one trillion, twenty-five billion, two hundred one million, fifteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •