Base | Representation |
---|---|
bin | 101011101010111011011… |
… | …000110000101110000011 |
3 | 101121220012000021122200211 |
4 | 223222323120300232003 |
5 | 343132102414044021 |
6 | 10214353221254551 |
7 | 426550226431546 |
oct | 53527330605603 |
9 | 11556160248624 |
10 | 3001031003011 |
11 | a57803845588 |
12 | 405753264457 |
13 | 189cc4303762 |
14 | a5371bd485d |
15 | 530e4eeb3e1 |
hex | 2babb630b83 |
3001031003011 has 2 divisors, whose sum is σ = 3001031003012. Its totient is φ = 3001031003010.
The previous prime is 3001031002889. The next prime is 3001031003017. The reversal of 3001031003011 is 1103001301003.
It is a happy number.
3001031003011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3001031003011 - 239 = 2451275189123 is a prime.
It is a super-2 number, since 2×30010310030112 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3001031002982 and 3001031003000.
It is not a weakly prime, because it can be changed into another prime (3001031003017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500515501505 + 1500515501506.
It is an arithmetic number, because the mean of its divisors is an integer number (1500515501506).
Almost surely, 23001031003011 is an apocalyptic number.
3001031003011 is a deficient number, since it is larger than the sum of its proper divisors (1).
3001031003011 is an equidigital number, since it uses as much as digits as its factorization.
3001031003011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 3001031003011 its reverse (1103001301003), we get a palindrome (4104032304014).
The spelling of 3001031003011 in words is "three trillion, one billion, thirty-one million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •