Base | Representation |
---|---|
bin | 10010111001011001… |
… | …00100101110011001 |
3 | 222012000211122202122 |
4 | 21130230210232121 |
5 | 131234122420400 |
6 | 4354405111025 |
7 | 506256060506 |
oct | 113454445631 |
9 | 28160748678 |
10 | 10145123225 |
11 | 4336726266 |
12 | 1b716b8475 |
13 | c58a9c6c3 |
14 | 6c353c4ad |
15 | 3e59c7685 |
hex | 25cb24b99 |
10145123225 has 24 divisors (see below), whose sum is σ = 12737250240. Its totient is φ = 8015112000.
The previous prime is 10145123221. The next prime is 10145123237. The reversal of 10145123225 is 52232154101.
10145123225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10145123225 - 22 = 10145123221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10145123194 and 10145123203.
It is not an unprimeable number, because it can be changed into a prime (10145123221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 841490 + ... + 853460.
It is an arithmetic number, because the mean of its divisors is an integer number (530718760).
Almost surely, 210145123225 is an apocalyptic number.
It is an amenable number.
10145123225 is a deficient number, since it is larger than the sum of its proper divisors (2592127015).
10145123225 is a wasteful number, since it uses less digits than its factorization.
10145123225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12401 (or 12396 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10145123225 its reverse (52232154101), we get a palindrome (62377277326).
The spelling of 10145123225 in words is "ten billion, one hundred forty-five million, one hundred twenty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •