Base | Representation |
---|---|
bin | 101011111111100000000… |
… | …111010101110111111001 |
3 | 101201000012120110002211022 |
4 | 223333200013111313321 |
5 | 344012323214430243 |
6 | 10232445244512225 |
7 | 431261532161345 |
oct | 53774007256771 |
9 | 11630176402738 |
10 | 3023122030073 |
11 | a6610a634142 |
12 | 409a9954b675 |
13 | 18c104c76cc2 |
14 | a6469aac625 |
15 | 5398960ab68 |
hex | 2bfe01d5df9 |
3023122030073 has 2 divisors, whose sum is σ = 3023122030074. Its totient is φ = 3023122030072.
The previous prime is 3023122030009. The next prime is 3023122030099. The reversal of 3023122030073 is 3700302213203.
It is an a-pointer prime, because the next prime (3023122030099) can be obtained adding 3023122030073 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2747064260329 + 276057769744 = 1657427^2 + 525412^2 .
It is a cyclic number.
It is not a de Polignac number, because 3023122030073 - 26 = 3023122030009 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (3023122050073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511561015036 + 1511561015037.
It is an arithmetic number, because the mean of its divisors is an integer number (1511561015037).
Almost surely, 23023122030073 is an apocalyptic number.
It is an amenable number.
3023122030073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3023122030073 is an equidigital number, since it uses as much as digits as its factorization.
3023122030073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 26.
Adding to 3023122030073 its reverse (3700302213203), we get a palindrome (6723424243276).
The spelling of 3023122030073 in words is "three trillion, twenty-three billion, one hundred twenty-two million, thirty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •