Base | Representation |
---|---|
bin | 1001001011111110010111… |
… | …0010110101010110110111 |
3 | 1022202200021121010100112210 |
4 | 2102333211302311112313 |
5 | 2311000002243433421 |
6 | 33252252305344503 |
7 | 2061540132251346 |
oct | 222774562652667 |
9 | 38680247110483 |
10 | 10101323421111 |
11 | 3244a46803a7a |
12 | 1171854938133 |
13 | 583720bb3580 |
14 | 26cc99c49b5d |
15 | 127b5a447576 |
hex | 92fe5cb55b7 |
10101323421111 has 8 divisors (see below), whose sum is σ = 14504464399600. Its totient is φ = 6216199028352.
The previous prime is 10101323421097. The next prime is 10101323421187. The reversal of 10101323421111 is 11112432310101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10101323421111 - 27 = 10101323420983 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 (10101323471111) 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, 129504146386 + ... + 129504146463.
It is an arithmetic number, because the mean of its divisors is an integer number (1813058049950).
Almost surely, 210101323421111 is an apocalyptic number.
10101323421111 is a deficient number, since it is larger than the sum of its proper divisors (4403140978489).
10101323421111 is a wasteful number, since it uses less digits than its factorization.
10101323421111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259008292865.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 10101323421111 its reverse (11112432310101), we get a palindrome (21213755731212).
The spelling of 10101323421111 in words is "ten trillion, one hundred one billion, three hundred twenty-three million, four hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •