Base | Representation |
---|---|
bin | 1001000111111001001101… |
… | …1011111100011011100001 |
3 | 1022111222100010022222022111 |
4 | 2101332103123330123201 |
5 | 2303322420341243241 |
6 | 33200140241235321 |
7 | 2053506015643342 |
oct | 221762333743341 |
9 | 38458303288274 |
10 | 10031222212321 |
11 | 3218243475282 |
12 | 1160150032b41 |
13 | 579c2b7c117b |
14 | 269729a0a0c9 |
15 | 125e05ee3c81 |
hex | 91f936fc6e1 |
10031222212321 has 8 divisors (see below), whose sum is σ = 10049680202240. Its totient is φ = 10012770579168.
The previous prime is 10031222212283. The next prime is 10031222212327. The reversal of 10031222212321 is 12321222213001.
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 10031222212321 - 215 = 10031222179553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10031222212292 and 10031222212301.
It is not an unprimeable number, because it can be changed into a prime (10031222212327) 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, 1575580 + ... + 4748146.
It is an arithmetic number, because the mean of its divisors is an integer number (1256210025280).
Almost surely, 210031222212321 is an apocalyptic number.
It is an amenable number.
10031222212321 is a deficient number, since it is larger than the sum of its proper divisors (18457989919).
10031222212321 is an equidigital number, since it uses as much as digits as its factorization.
10031222212321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3178383.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10031222212321 its reverse (12321222213001), we get a palindrome (22352444425322).
The spelling of 10031222212321 in words is "ten trillion, thirty-one billion, two hundred twenty-two million, two hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •