Base | Representation |
---|---|
bin | 101011110110010110110… |
… | …011101010101101110001 |
3 | 101200001212012201010000200 |
4 | 223312112303222231301 |
5 | 343332220330414301 |
6 | 10224143015505413 |
7 | 430463303046555 |
oct | 53662663525561 |
9 | 11601765633020 |
10 | 3013302201201 |
11 | a61a30599396 |
12 | 407bb8988269 |
13 | 18b1cb6c0586 |
14 | a5bb7849865 |
15 | 535b248bc86 |
hex | 2bd96ceab71 |
3013302201201 has 12 divisors (see below), whose sum is σ = 4423900864500. Its totient is φ = 1975935869280.
The previous prime is 3013302201191. The next prime is 3013302201223. The reversal of 3013302201201 is 1021022033103.
3013302201201 is a `hidden beast` number, since 301 + 330 + 2 + 20 + 12 + 0 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 821270937600 + 2192031263601 = 906240^2 + 1480551^2 .
It is not a de Polignac number, because 3013302201201 - 214 = 3013302184817 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3013302201001) 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, 2744354826 + ... + 2744355923.
It is an arithmetic number, because the mean of its divisors is an integer number (368658405375).
Almost surely, 23013302201201 is an apocalyptic number.
It is an amenable number.
3013302201201 is a deficient number, since it is larger than the sum of its proper divisors (1410598663299).
3013302201201 is a wasteful number, since it uses less digits than its factorization.
3013302201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5488710816 (or 5488710813 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 3013302201201 its reverse (1021022033103), we get a palindrome (4034324234304).
The spelling of 3013302201201 in words is "three trillion, thirteen billion, three hundred two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •