Base | Representation |
---|---|
bin | 1101110010011111100001… |
… | …00100000100100110000110 |
3 | 10222100202220221220022022010 |
4 | 12321033300210010212012 |
5 | 12433244341243132220 |
6 | 144253455300315050 |
7 | 6246464430326220 |
oct | 671176044044606 |
9 | 128322827808263 |
10 | 30322210130310 |
11 | 9730639135a4a |
12 | 34987929a2a86 |
13 | 13bc4ab7b30a7 |
14 | 76b86212b410 |
15 | 378b3c2721e0 |
hex | 1b93f0904986 |
30322210130310 has 128 divisors (see below), whose sum is σ = 89723357835264. Its totient is φ = 6400019957760.
The previous prime is 30322210130297. The next prime is 30322210130461. The reversal of 30322210130310 is 1303101222303.
It is a super-2 number, since 2×303222101303102 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 79939246 + ... + 80317665.
It is an arithmetic number, because the mean of its divisors is an integer number (700963733088).
Almost surely, 230322210130310 is an apocalyptic number.
30322210130310 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30322210130310 is an abundant number, since it is smaller than the sum of its proper divisors (59401147704954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30322210130310 is a wasteful number, since it uses less digits than its factorization.
30322210130310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160256998.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30322210130310 its reverse (1303101222303), we get a palindrome (31625311352613).
The spelling of 30322210130310 in words is "thirty trillion, three hundred twenty-two billion, two hundred ten million, one hundred thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •