Base | Representation |
---|---|
bin | 1101101111010100000111… |
… | …10111011101000010111101 |
3 | 10221222100001202221101200101 |
4 | 12313222003313131002331 |
5 | 12430002222122443003 |
6 | 144131355524201101 |
7 | 6235550416230511 |
oct | 667520367350275 |
9 | 127870052841611 |
10 | 30213012312253 |
11 | 96992a2887021 |
12 | 347b598839191 |
13 | 13b20c8551274 |
14 | 7664636c0141 |
15 | 375d9a7d311d |
hex | 1b7a83ddd0bd |
30213012312253 has 2 divisors, whose sum is σ = 30213012312254. Its totient is φ = 30213012312252.
The previous prime is 30213012312211. The next prime is 30213012312277. The reversal of 30213012312253 is 35221321031203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21080751938884 + 9132260373369 = 4591378^2 + 3021963^2 .
It is a cyclic number.
It is not a de Polignac number, because 30213012312253 - 225 = 30212978757821 is a prime.
It is a super-2 number, since 2×302130123122532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30213012310253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106506156126 + 15106506156127.
It is an arithmetic number, because the mean of its divisors is an integer number (15106506156127).
Almost surely, 230213012312253 is an apocalyptic number.
It is an amenable number.
30213012312253 is a deficient number, since it is larger than the sum of its proper divisors (1).
30213012312253 is an equidigital number, since it uses as much as digits as its factorization.
30213012312253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 30213012312253 its reverse (35221321031203), we get a palindrome (65434333343456).
The spelling of 30213012312253 in words is "thirty trillion, two hundred thirteen billion, twelve million, three hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •