Base | Representation |
---|---|
bin | 1101110010100001000001… |
… | …11101100110110010011010 |
3 | 10222100212000112211011220221 |
4 | 12321100200331212302122 |
5 | 12433303022131132310 |
6 | 144254112024310254 |
7 | 6246523520242216 |
oct | 671204075466232 |
9 | 128325015734827 |
10 | 30323022130330 |
11 | 9730a15522646 |
12 | 349897a91238a |
13 | 13bc5aaaa7c87 |
14 | 76b8dbcdb946 |
15 | 378b886b9ada |
hex | 1b9420f66c9a |
30323022130330 has 128 divisors (see below), whose sum is σ = 57867138201600. Its totient is φ = 11424476792064.
The previous prime is 30323022130321. The next prime is 30323022130339. The reversal of 30323022130330 is 3303122032303.
It is an interprime number because it is at equal distance from previous prime (30323022130321) and next prime (30323022130339).
It is a super-2 number, since 2×303230221303302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30323022130295 and 30323022130304.
It is not an unprimeable number, because it can be changed into a prime (30323022130339) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 572073609 + ... + 572126611.
It is an arithmetic number, because the mean of its divisors is an integer number (452087017200).
Almost surely, 230323022130330 is an apocalyptic number.
30323022130330 is a deficient number, since it is larger than the sum of its proper divisors (27544116071270).
30323022130330 is a wasteful number, since it uses less digits than its factorization.
30323022130330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53428.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 30323022130330 its reverse (3303122032303), we get a palindrome (33626144162633).
The spelling of 30323022130330 in words is "thirty trillion, three hundred twenty-three billion, twenty-two million, one hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •