Base | Representation |
---|---|
bin | 1001001110001111010001… |
… | …1111010000111101101101 |
3 | 1022220101200200122210121000 |
4 | 2103203310133100331231 |
5 | 2312114140002431323 |
6 | 33322204354030513 |
7 | 2064415135266132 |
oct | 223436437207555 |
9 | 38811620583530 |
10 | 10140224655213 |
11 | 325a49950aa24 |
12 | 11792b0878439 |
13 | 5872b0427aa3 |
14 | 270b0a51a589 |
15 | 128b8573de43 |
hex | 938f47d0f6d |
10140224655213 has 16 divisors (see below), whose sum is σ = 15171293217600. Its totient is φ = 6693217592400.
The previous prime is 10140224655173. The next prime is 10140224655241. The reversal of 10140224655213 is 31255642204101.
10140224655213 is a `hidden beast` number, since 1 + 0 + 1 + 40 + 22 + 46 + 552 + 1 + 3 = 666.
It is not a de Polignac number, because 10140224655213 - 217 = 10140224524141 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140224655293) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1859224383 + ... + 1859229836.
It is an arithmetic number, because the mean of its divisors is an integer number (948205826100).
Almost surely, 210140224655213 is an apocalyptic number.
It is an amenable number.
10140224655213 is a deficient number, since it is larger than the sum of its proper divisors (5031068562387).
10140224655213 is a wasteful number, since it uses less digits than its factorization.
10140224655213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3718454329 (or 3718454323 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
Adding to 10140224655213 its reverse (31255642204101), we get a palindrome (41395866859314).
The spelling of 10140224655213 in words is "ten trillion, one hundred forty billion, two hundred twenty-four million, six hundred fifty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •