Base | Representation |
---|---|
bin | 101011101011110101001… |
… | …101110001011101101001 |
3 | 101121222200121212211010201 |
4 | 223223311031301131221 |
5 | 343141044301413001 |
6 | 10215033400112201 |
7 | 426613250120245 |
oct | 53536515613551 |
9 | 11558617784121 |
10 | 3002001201001 |
11 | a58161463700 |
12 | 405984165661 |
13 | 18a11a307aca |
14 | a54249c5425 |
15 | 53150292501 |
hex | 2baf5371769 |
3002001201001 has 12 divisors (see below), whose sum is σ = 3300144786036. Its totient is φ = 2728740945920.
The previous prime is 3002001200993. The next prime is 3002001201007. The reversal of 3002001201001 is 1001021002003.
It can be written as a sum of positive squares in 2 ways, for example, as 2973986475625 + 28014725376 = 1724525^2 + 167376^2 .
It is not a de Polignac number, because 3002001201001 - 23 = 3002001200993 is a prime.
It is a super-2 number, since 2×30020012010012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3002001201007) 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, 648856 + ... + 2534761.
It is an arithmetic number, because the mean of its divisors is an integer number (275012065503).
Almost surely, 23002001201001 is an apocalyptic number.
It is an amenable number.
3002001201001 is a deficient number, since it is larger than the sum of its proper divisors (298143585035).
3002001201001 is a wasteful number, since it uses less digits than its factorization.
3002001201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3191432 (or 3191421 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 3002001201001 its reverse (1001021002003), we get a palindrome (4003022203004).
The spelling of 3002001201001 in words is "three trillion, two billion, one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •