Base | Representation |
---|---|
bin | 1001000110001100110000… |
… | …1101101111110110010011 |
3 | 1022102012012020121102111201 |
4 | 2101203030031233312103 |
5 | 2302333310131133021 |
6 | 33134523402052031 |
7 | 2051425416256123 |
oct | 221431415576623 |
9 | 38365166542451 |
10 | 10002110021011 |
11 | 3206964397039 |
12 | 11565864aa017 |
13 | 57726c344674 |
14 | 268167466c83 |
15 | 1252a02d9591 |
hex | 918cc36fd93 |
10002110021011 has 4 divisors (see below), whose sum is σ = 10003116178224. Its totient is φ = 10001103863800.
The previous prime is 10002110020967. The next prime is 10002110021023. The reversal of 10002110021011 is 11012001120001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10002110021011 - 27 = 10002110020883 is a prime.
It is a super-2 number, since 2×100021100210112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002110021611) 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 3 ways as a sum of consecutive naturals, for example, 503063695 + ... + 503083576.
It is an arithmetic number, because the mean of its divisors is an integer number (2500779044556).
Almost surely, 210002110021011 is an apocalyptic number.
10002110021011 is a deficient number, since it is larger than the sum of its proper divisors (1006157213).
10002110021011 is an equidigital number, since it uses as much as digits as its factorization.
10002110021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006157212.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10002110021011 its reverse (11012001120001), we get a palindrome (21014111141012).
The spelling of 10002110021011 in words is "ten trillion, two billion, one hundred ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •