Base | Representation |
---|---|
bin | 1011010010100100… |
… | …1101101111100001 |
3 | 21211012210200000222 |
4 | 2310221031233201 |
5 | 22201324444243 |
6 | 1220422252425 |
7 | 135050360006 |
oct | 26451155741 |
9 | 7735720028 |
10 | 3030703073 |
11 | 1315831092 |
12 | 706b87115 |
13 | 393b74538 |
14 | 20a7198ad |
15 | 12b10b168 |
hex | b4a4dbe1 |
3030703073 has 2 divisors, whose sum is σ = 3030703074. Its totient is φ = 3030703072.
The previous prime is 3030703069. The next prime is 3030703103. The reversal of 3030703073 is 3703070303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3002272849 + 28430224 = 54793^2 + 5332^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030703073 - 22 = 3030703069 is a prime.
It is a super-2 number, since 2×30307030732 = 18370322233383286658, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3030703573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515351536 + 1515351537.
It is an arithmetic number, because the mean of its divisors is an integer number (1515351537).
Almost surely, 23030703073 is an apocalyptic number.
It is an amenable number.
3030703073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030703073 is an equidigital number, since it uses as much as digits as its factorization.
3030703073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3969, while the sum is 26.
The square root of 3030703073 is about 55051.8217046448. The cubic root of 3030703073 is about 1447.1530461656.
Adding to 3030703073 its reverse (3703070303), we get a palindrome (6733773376).
The spelling of 3030703073 in words is "three billion, thirty million, seven hundred three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •