Base | Representation |
---|---|
bin | 1101101111010100000110… |
… | …10000100000010101100001 |
3 | 10221222100001001201200000001 |
4 | 12313222003100200111201 |
5 | 12430002212014231423 |
6 | 144131354521300001 |
7 | 6235550233364365 |
oct | 667520320402541 |
9 | 127870031650001 |
10 | 30213002102113 |
11 | 9699298042a96 |
12 | 347b595334601 |
13 | 13b20c63b7b6c |
14 | 7664621c32a5 |
15 | 375d99967cad |
hex | 1b7a83420561 |
30213002102113 has 2 divisors, whose sum is σ = 30213002102114. Its totient is φ = 30213002102112.
The previous prime is 30213002102033. The next prime is 30213002102137. The reversal of 30213002102113 is 31120120031203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22274312667489 + 7938689434624 = 4719567^2 + 2817568^2 .
It is a cyclic number.
It is not a de Polignac number, because 30213002102113 - 221 = 30213000004961 is a prime.
It is not a weakly prime, because it can be changed into another prime (30213002102183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106501051056 + 15106501051057.
It is an arithmetic number, because the mean of its divisors is an integer number (15106501051057).
Almost surely, 230213002102113 is an apocalyptic number.
It is an amenable number.
30213002102113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30213002102113 is an equidigital number, since it uses as much as digits as its factorization.
30213002102113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30213002102113 its reverse (31120120031203), we get a palindrome (61333122133316).
The spelling of 30213002102113 in words is "thirty trillion, two hundred thirteen billion, two million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •