Base | Representation |
---|---|
bin | 1001000111011010101000… |
… | …0101101100011101010111 |
3 | 1022111012010221222021210200 |
4 | 2101312222011230131113 |
5 | 2303204112123233421 |
6 | 33152301442551543 |
7 | 2053065406011426 |
oct | 221665205543527 |
9 | 38435127867720 |
10 | 10023012321111 |
11 | 3214810179519 |
12 | 115a63a6685b3 |
13 | 57922093c88a |
14 | 26918b5072bd |
15 | 125ac5388726 |
hex | 91daa16c757 |
10023012321111 has 48 divisors (see below), whose sum is σ = 15337194762240. Its totient is φ = 6289891937280.
The previous prime is 10023012321097. The next prime is 10023012321143. The reversal of 10023012321111 is 11112321032001.
10023012321111 is a `hidden beast` number, since 1 + 0 + 0 + 230 + 1 + 2 + 321 + 111 = 666.
It is not a de Polignac number, because 10023012321111 - 25 = 10023012321079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023012321611) 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 47 ways as a sum of consecutive naturals, for example, 27109866 + ... + 27477096.
It is an arithmetic number, because the mean of its divisors is an integer number (319524890880).
Almost surely, 210023012321111 is an apocalyptic number.
10023012321111 is a deficient number, since it is larger than the sum of its proper divisors (5314182441129).
10023012321111 is a wasteful number, since it uses less digits than its factorization.
10023012321111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368276 (or 368273 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10023012321111 its reverse (11112321032001), we get a palindrome (21135333353112).
The spelling of 10023012321111 in words is "ten trillion, twenty-three billion, twelve million, three hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •