Base | Representation |
---|---|
bin | 1001001101110001011110… |
… | …0000000100001110000011 |
3 | 1022212122000222111120000222 |
4 | 2103130113200010032003 |
5 | 2312001242331224443 |
6 | 33314402324133255 |
7 | 2064012624053006 |
oct | 223342740041603 |
9 | 38778028446028 |
10 | 10132222133123 |
11 | 325706227a702 |
12 | 117783883722b |
13 | 586606510a0c |
14 | 27058b79753d |
15 | 128867de6468 |
hex | 93717804383 |
10132222133123 has 8 divisors (see below), whose sum is σ = 10247867604000. Its totient is φ = 10016616668608.
The previous prime is 10132222133119. The next prime is 10132222133177. The reversal of 10132222133123 is 32133122223101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10132222133123 - 22 = 10132222133119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132222133092 and 10132222133101.
It is not an unprimeable number, because it can be changed into a prime (10132222130123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9492023 + ... + 10505376.
It is an arithmetic number, because the mean of its divisors is an integer number (1280983450500).
Almost surely, 210132222133123 is an apocalyptic number.
10132222133123 is a deficient number, since it is larger than the sum of its proper divisors (115645470877).
10132222133123 is an equidigital number, since it uses as much as digits as its factorization.
10132222133123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20003181.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10132222133123 its reverse (32133122223101), we get a palindrome (42265344356224).
The spelling of 10132222133123 in words is "ten trillion, one hundred thirty-two billion, two hundred twenty-two million, one hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •