Base | Representation |
---|---|
bin | 1001000111110100110001… |
… | …1100010010101001110011 |
3 | 1022111212021010002021012112 |
4 | 2101331030130102221303 |
5 | 2303313000431333021 |
6 | 33155422132115535 |
7 | 2053434343561046 |
oct | 221751434225163 |
9 | 38455233067175 |
10 | 10030031121011 |
11 | 32177920a37a0 |
12 | 115ba79165bab |
13 | 579a9bac8905 |
14 | 269655758c5d |
15 | 125d86667d5b |
hex | 91f4c712a73 |
10030031121011 has 16 divisors (see below), whose sum is σ = 10990825923168. Its totient is φ = 9077412960000.
The previous prime is 10030031120917. The next prime is 10030031121017. The reversal of 10030031121011 is 11012113003001.
It is a happy number.
10030031121011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10030031121011 - 222 = 10030026926707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10030031121017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13743365 + ... + 14454761.
It is an arithmetic number, because the mean of its divisors is an integer number (686926620198).
Almost surely, 210030031121011 is an apocalyptic number.
10030031121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10030031121011 is a deficient number, since it is larger than the sum of its proper divisors (960794802157).
10030031121011 is a wasteful number, since it uses less digits than its factorization.
10030031121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 717142.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10030031121011 its reverse (11012113003001), we get a palindrome (21042144124012).
The spelling of 10030031121011 in words is "ten trillion, thirty billion, thirty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •