Base | Representation |
---|---|
bin | 1000111000000111000… |
… | …11100010000000110101 |
3 | 1002011021010200102021011 |
4 | 10130003203202000311 |
5 | 14444121043332041 |
6 | 352041030152221 |
7 | 31015145656363 |
oct | 4340343420065 |
9 | 1064233612234 |
10 | 305002324021 |
11 | 10839495138a |
12 | 4b1407b2671 |
13 | 229b92c2255 |
14 | 10a9564a633 |
15 | 7e01923e81 |
hex | 47038e2035 |
305002324021 has 2 divisors, whose sum is σ = 305002324022. Its totient is φ = 305002324020.
The previous prime is 305002324013. The next prime is 305002324061. The reversal of 305002324021 is 120423200503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 281418579121 + 23583744900 = 530489^2 + 153570^2 .
It is a cyclic number.
It is not a de Polignac number, because 305002324021 - 23 = 305002324013 is a prime.
It is a super-2 number, since 2×3050023240212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305002323983 and 305002324001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (305002324061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152501162010 + 152501162011.
It is an arithmetic number, because the mean of its divisors is an integer number (152501162011).
Almost surely, 2305002324021 is an apocalyptic number.
It is an amenable number.
305002324021 is a deficient number, since it is larger than the sum of its proper divisors (1).
305002324021 is an equidigital number, since it uses as much as digits as its factorization.
305002324021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 305002324021 its reverse (120423200503), we get a palindrome (425425524524).
The spelling of 305002324021 in words is "three hundred five billion, two million, three hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •