Base | Representation |
---|---|
bin | 11101000110101011110… |
… | …01011010111000101101 |
3 | 10112121020011221221112202 |
4 | 32203111321122320231 |
5 | 112341020334341023 |
6 | 2043223040511245 |
7 | 132151311231362 |
oct | 16432571327055 |
9 | 3477204857482 |
10 | 1000021012013 |
11 | 3561198775a1 |
12 | 14198901b525 |
13 | 733bc74479a |
14 | 36589156469 |
15 | 1b02d517128 |
hex | e8d5e5ae2d |
1000021012013 has 8 divisors (see below), whose sum is σ = 1034068819200. Its totient is φ = 966085021440.
The previous prime is 1000021012009. The next prime is 1000021012033. The reversal of 1000021012013 is 3102101200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000021012013 - 22 = 1000021012009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000021011985 and 1000021012003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000021012033) 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 7 ways as a sum of consecutive naturals, for example, 27935963 + ... + 27971736.
It is an arithmetic number, because the mean of its divisors is an integer number (129258602400).
Almost surely, 21000021012013 is an apocalyptic number.
It is an amenable number.
1000021012013 is a deficient number, since it is larger than the sum of its proper divisors (34047807187).
1000021012013 is an equidigital number, since it uses as much as digits as its factorization.
1000021012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55908307.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1000021012013 its reverse (3102101200001), we get a palindrome (4102122212014).
The spelling of 1000021012013 in words is "one trillion, twenty-one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •