Base | Representation |
---|---|
bin | 1101110001111000011001… |
… | …11111000011110000011101 |
3 | 10222021202201120110101110021 |
4 | 12320330030333003300131 |
5 | 12432423340301132313 |
6 | 144240103520312141 |
7 | 6245122166301334 |
oct | 670741477036035 |
9 | 128252646411407 |
10 | 30301212130333 |
11 | 9722743329861 |
12 | 34946b2772651 |
13 | 13ba51341b731 |
14 | 76a82d498d1b |
15 | 37830dabc78d |
hex | 1b8f0cfc3c1d |
30301212130333 has 2 divisors, whose sum is σ = 30301212130334. Its totient is φ = 30301212130332.
The previous prime is 30301212130309. The next prime is 30301212130457. The reversal of 30301212130333 is 33303121210303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21720278892004 + 8580933238329 = 4660502^2 + 2929323^2 .
It is a cyclic number.
It is not a de Polignac number, because 30301212130333 - 213 = 30301212122141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30301212130298 and 30301212130307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30301212133333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15150606065166 + 15150606065167.
It is an arithmetic number, because the mean of its divisors is an integer number (15150606065167).
Almost surely, 230301212130333 is an apocalyptic number.
It is an amenable number.
30301212130333 is a deficient number, since it is larger than the sum of its proper divisors (1).
30301212130333 is an equidigital number, since it uses as much as digits as its factorization.
30301212130333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 30301212130333 its reverse (33303121210303), we get a palindrome (63604333340636).
The spelling of 30301212130333 in words is "thirty trillion, three hundred one billion, two hundred twelve million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •