Base | Representation |
---|---|
bin | 11100001001011001… |
… | …010011101000001101 |
3 | 2220000020202222211122 |
4 | 130021121103220031 |
5 | 443343413300023 |
6 | 21514534530325 |
7 | 2116640106251 |
oct | 341131235015 |
9 | 86006688748 |
10 | 30222400013 |
11 | 118a98364a3 |
12 | 5a355069a5 |
13 | 2b08493040 |
14 | 1669bbc261 |
15 | bbd40a2c8 |
hex | 709653a0d |
30222400013 has 8 divisors (see below), whose sum is σ = 32548902456. Its totient is φ = 27896140800.
The previous prime is 30222400007. The next prime is 30222400067. The reversal of 30222400013 is 31000422203.
It can be written as a sum of positive squares in 4 ways, for example, as 2292302884 + 27930097129 = 47878^2 + 167123^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30222400013 - 214 = 30222383629 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30222399964 and 30222400000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30222400073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 259973 + ... + 357813.
It is an arithmetic number, because the mean of its divisors is an integer number (4068612807).
Almost surely, 230222400013 is an apocalyptic number.
It is an amenable number.
30222400013 is a deficient number, since it is larger than the sum of its proper divisors (2326502443).
30222400013 is a wasteful number, since it uses less digits than its factorization.
30222400013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121615.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 30222400013 its reverse (31000422203), we get a palindrome (61222822216).
The spelling of 30222400013 in words is "thirty billion, two hundred twenty-two million, four hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •