Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …011101100100001010001 |
3 | 21002022012012011012022120 |
4 | 131013222323230201101 |
5 | 230241223413410113 |
6 | 4131143201524453 |
7 | 264401104325340 |
oct | 35075273544121 |
9 | 7068165135276 |
10 | 2001101310033 |
11 | 701731580371 |
12 | 2839b0943729 |
13 | 11691a783407 |
14 | 6cbd4c4db57 |
15 | 370bea21a23 |
hex | 1d1eaeec851 |
2001101310033 has 8 divisors (see below), whose sum is σ = 3049297234368. Its totient is φ = 1143486462864.
The previous prime is 2001101310031. The next prime is 2001101310113. The reversal of 2001101310033 is 3300131011002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001101310033 - 21 = 2001101310031 is a prime.
It is a super-2 number, since 2×20011013100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001101309994 and 2001101310021.
It is not an unprimeable number, because it can be changed into a prime (2001101310031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47645269266 + ... + 47645269307.
It is an arithmetic number, because the mean of its divisors is an integer number (381162154296).
Almost surely, 22001101310033 is an apocalyptic number.
It is an amenable number.
2001101310033 is a deficient number, since it is larger than the sum of its proper divisors (1048195924335).
2001101310033 is an equidigital number, since it uses as much as digits as its factorization.
2001101310033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95290538583.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2001101310033 its reverse (3300131011002), we get a palindrome (5301232321035).
The spelling of 2001101310033 in words is "two trillion, one billion, one hundred one million, three hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •