Base | Representation |
---|---|
bin | 1001001101110001011011… |
… | …0011000011010111001101 |
3 | 1022212122000011022001111022 |
4 | 2103130112303003113031 |
5 | 2312001231321130013 |
6 | 33314401223203525 |
7 | 2064012421545500 |
oct | 223342663032715 |
9 | 38778004261438 |
10 | 10132210333133 |
11 | 3257056650149 |
12 | 11778348a65a5 |
13 | 586603c3ba85 |
14 | 270589da5137 |
15 | 128866d65008 |
hex | 93716cc35cd |
10132210333133 has 24 divisors (see below), whose sum is σ = 11865183522624. Its totient is φ = 8626743216000.
The previous prime is 10132210333123. The next prime is 10132210333139. The reversal of 10132210333133 is 33133301223101.
It is not a de Polignac number, because 10132210333133 - 24 = 10132210333117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132210333139) 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 23 ways as a sum of consecutive naturals, for example, 194723066 + ... + 194775092.
It is an arithmetic number, because the mean of its divisors is an integer number (494382646776).
Almost surely, 210132210333133 is an apocalyptic number.
It is an amenable number.
10132210333133 is a deficient number, since it is larger than the sum of its proper divisors (1732973189491).
10132210333133 is a wasteful number, since it uses less digits than its factorization.
10132210333133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78513 (or 78506 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 10132210333133 its reverse (33133301223101), we get a palindrome (43265511556234).
The spelling of 10132210333133 in words is "ten trillion, one hundred thirty-two billion, two hundred ten million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •