Base | Representation |
---|---|
bin | 1001010011101101011000… |
… | …0010011001010011011001 |
3 | 1100020101021012120222001210 |
4 | 2110323112002121103121 |
5 | 2320134121440114400 |
6 | 33433310013133333 |
7 | 2104253043416646 |
oct | 224732602312331 |
9 | 40211235528053 |
10 | 10234203051225 |
11 | 32963348a98aa |
12 | 1193559a8a249 |
13 | 59310954623a |
14 | 2754a3946dcd |
15 | 12b335ec4950 |
hex | 94ed60994d9 |
10234203051225 has 12 divisors (see below), whose sum is σ = 16920549044816. Its totient is φ = 5458241627280.
The previous prime is 10234203051199. The next prime is 10234203051229. The reversal of 10234203051225 is 52215030243201.
It is not a de Polignac number, because 10234203051225 - 26 = 10234203051161 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10234203051192 and 10234203051201.
It is not an unprimeable number, because it can be changed into a prime (10234203051229) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68228020267 + ... + 68228020416.
Almost surely, 210234203051225 is an apocalyptic number.
10234203051225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10234203051225 is a deficient number, since it is larger than the sum of its proper divisors (6686345993591).
10234203051225 is a wasteful number, since it uses less digits than its factorization.
10234203051225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136456040696 (or 136456040691 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 10234203051225 its reverse (52215030243201), we get a palindrome (62449233294426).
The spelling of 10234203051225 in words is "ten trillion, two hundred thirty-four billion, two hundred three million, fifty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •