Base | Representation |
---|---|
bin | 1001001101110101001110… |
… | …1001110001010010111010 |
3 | 1022212201122022110001110201 |
4 | 2103131103221301102322 |
5 | 2312010324203410020 |
6 | 33315050414232414 |
7 | 2064046626654454 |
oct | 223352351612272 |
9 | 38781568401421 |
10 | 10133231310010 |
11 | 325752a9a1196 |
12 | 1177a7a7b570a |
13 | 586737611bc3 |
14 | 2706458132d4 |
15 | 1288c67dba0a |
hex | 93753a714ba |
10133231310010 has 8 divisors (see below), whose sum is σ = 18239816358036. Its totient is φ = 4053292524000.
The previous prime is 10133231309987. The next prime is 10133231310023. The reversal of 10133231310010 is 1001313233101.
It can be written as a sum of positive squares in 2 ways, for example, as 10005347113129 + 127884196881 = 3163123^2 + 357609^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10133231310010.
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 3 ways as a sum of consecutive naturals, for example, 506661565491 + ... + 506661565510.
Almost surely, 210133231310010 is an apocalyptic number.
10133231310010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10133231310010 is a deficient number, since it is larger than the sum of its proper divisors (8106585048026).
10133231310010 is a wasteful number, since it uses less digits than its factorization.
10133231310010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013323131008.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10133231310010 its reverse (1001313233101), we get a palindrome (11134544543111).
The spelling of 10133231310010 in words is "ten trillion, one hundred thirty-three billion, two hundred thirty-one million, three hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •