Base | Representation |
---|---|
bin | 1001000111111000110001… |
… | …1001011000011101111101 |
3 | 1022111222000220002020222021 |
4 | 2101332030121120131331 |
5 | 2303322200122201341 |
6 | 33200120421520141 |
7 | 2053503053004241 |
oct | 221761431303575 |
9 | 38458026066867 |
10 | 10031104100221 |
11 | 3218192832976 |
12 | 1160118573051 |
13 | 579c101a8659 |
14 | 269718062421 |
15 | 125dea9629d1 |
hex | 91f8c65877d |
10031104100221 has 8 divisors (see below), whose sum is σ = 10061475961824. Its totient is φ = 10000767051600.
The previous prime is 10031104100219. The next prime is 10031104100299. The reversal of 10031104100221 is 12200140113001.
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 10031104100221 - 21 = 10031104100219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10031104100195 and 10031104100204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10031104100821) 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, 8126031 + ... + 9278716.
It is an arithmetic number, because the mean of its divisors is an integer number (1257684495228).
Almost surely, 210031104100221 is an apocalyptic number.
It is an amenable number.
10031104100221 is a deficient number, since it is larger than the sum of its proper divisors (30371861603).
10031104100221 is a wasteful number, since it uses less digits than its factorization.
10031104100221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17406491.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10031104100221 its reverse (12200140113001), we get a palindrome (22231244213222).
The spelling of 10031104100221 in words is "ten trillion, thirty-one billion, one hundred four million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •