Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …11001111110001001001 |
3 | 10112121012111010112111200 |
4 | 32203111103033301021 |
5 | 112341010304130001 |
6 | 2043222042214413 |
7 | 132151130202411 |
oct | 16432523176111 |
9 | 3477174115450 |
10 | 1000011005001 |
11 | 356114162138 |
12 | 1419857b4409 |
13 | 733ba64c988 |
14 | 36587aad641 |
15 | 1b02c6dc086 |
hex | e8d54cfc49 |
1000011005001 has 12 divisors (see below), whose sum is σ = 1457959971312. Its totient is φ = 660443404536.
The previous prime is 1000011004931. The next prime is 1000011005023. The reversal of 1000011005001 is 1005001100001.
It is not a de Polignac number, because 1000011005001 - 27 = 1000011004873 is a prime.
It is a super-2 number, since 2×10000110050012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1000011005801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 519215551 + ... + 519217476.
It is an arithmetic number, because the mean of its divisors is an integer number (121496664276).
Almost surely, 21000011005001 is an apocalyptic number.
It is an amenable number.
1000011005001 is a deficient number, since it is larger than the sum of its proper divisors (457948966311).
1000011005001 is a wasteful number, since it uses less digits than its factorization.
1000011005001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1038433140 (or 1038433137 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 1000011005001 its reverse (1005001100001), we get a palindrome (2005012105002).
It can be divided in two parts, 100001 and 1005001, that multiplied together give a palindrome (100501105001).
The spelling of 1000011005001 in words is "one trillion, eleven million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •