Base | Representation |
---|---|
bin | 1001000110110010000001… |
… | …0100111010101001101001 |
3 | 1022110011000020102221112110 |
4 | 2101230200110322221221 |
5 | 2303014300421333001 |
6 | 33143300024232533 |
7 | 2052231306232053 |
oct | 221544024725151 |
9 | 38404006387473 |
10 | 10012111121001 |
11 | 3210126792530 |
12 | 11584b790b749 |
13 | 5781a4328702 |
14 | 2688357d48d3 |
15 | 1256883133d6 |
hex | 91b2053aa69 |
10012111121001 has 128 divisors (see below), whose sum is σ = 15455366922240. Its totient is φ = 5709331353600.
The previous prime is 10012111120969. The next prime is 10012111121009.
10012111121001 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10012111121001 - 25 = 10012111120969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10012111121009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2134321066 + ... + 2134325756.
It is an arithmetic number, because the mean of its divisors is an integer number (120745054080).
Almost surely, 210012111121001 is an apocalyptic number.
10012111121001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10012111121001 is a deficient number, since it is larger than the sum of its proper divisors (5443255801239).
10012111121001 is a wasteful number, since it uses less digits than its factorization.
10012111121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5167.
The product of its (nonzero) digits is 4, while the sum is 12.
It can be divided in two parts, 1001211 and 1121001, that multiplied together give a palindrome (1122358532211).
The spelling of 10012111121001 in words is "ten trillion, twelve billion, one hundred eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •