Base | Representation |
---|---|
bin | 1001010001111101010010… |
… | …1010111111001000011001 |
3 | 1100010111121100022012202111 |
4 | 2110133110222333020121 |
5 | 2314141012013211200 |
6 | 33411412245432321 |
7 | 2102136330340201 |
oct | 224372452771031 |
9 | 40114540265674 |
10 | 10204115366425 |
11 | 32845a51159a2 |
12 | 118976170b6a1 |
13 | 590322c5cc56 |
14 | 273c4b9d5401 |
15 | 12a67482a0ba |
hex | 947d4abf219 |
10204115366425 has 12 divisors (see below), whose sum is σ = 12653199032320. Its totient is φ = 8163230371920.
The previous prime is 10204115366399. The next prime is 10204115366429. The reversal of 10204115366425 is 52466351140201.
It is not a de Polignac number, because 10204115366425 - 219 = 10204114842137 is a prime.
It is a super-3 number, since 3×102041153664253 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10204115366429) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1970536 + ... + 4928614.
Almost surely, 210204115366425 is an apocalyptic number.
It is an amenable number.
10204115366425 is a deficient number, since it is larger than the sum of its proper divisors (2449083665895).
10204115366425 is a wasteful number, since it uses less digits than its factorization.
10204115366425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3096072 (or 3096067 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 40.
It can be divided in two parts, 1020411 and 5366425, that added together give a palindrome (6386836).
The spelling of 10204115366425 in words is "ten trillion, two hundred four billion, one hundred fifteen million, three hundred sixty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •