Base | Representation |
---|---|
bin | 1101110010011111001011… |
… | …10101011011011101010110 |
3 | 10222100202110102012101201010 |
4 | 12321033211311123131112 |
5 | 12433244004203143110 |
6 | 144253425350313050 |
7 | 6246460113343041 |
oct | 671174565333526 |
9 | 128322412171633 |
10 | 30322030131030 |
11 | 9730556573910 |
12 | 3498742658786 |
13 | 13bc48040c641 |
14 | 76b846273c58 |
15 | 378b2b569020 |
hex | 1b93e5d5b756 |
30322030131030 has 64 divisors (see below), whose sum is σ = 80116923744000. Its totient is φ = 7283356686720.
The previous prime is 30322030130999. The next prime is 30322030131077. The reversal of 30322030131030 is 3013103022303.
It is a super-2 number, since 2×303220301310302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30322030130988 and 30322030131006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 421454580 + ... + 421526519.
It is an arithmetic number, because the mean of its divisors is an integer number (1251826933500).
Almost surely, 230322030131030 is an apocalyptic number.
30322030131030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30322030131030 is an abundant number, since it is smaller than the sum of its proper divisors (49794893612970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30322030131030 is a wasteful number, since it uses less digits than its factorization.
30322030131030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842981229.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30322030131030 its reverse (3013103022303), we get a palindrome (33335133153333).
The spelling of 30322030131030 in words is "thirty trillion, three hundred twenty-two billion, thirty million, one hundred thirty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •