Base | Representation |
---|---|
bin | 1101110001111000011000… |
… | …10101110010110100001000 |
3 | 10222021202200211002210220111 |
4 | 12320330030111302310020 |
5 | 12432423330014004112 |
6 | 144240102452404104 |
7 | 6245122005326116 |
oct | 670741425626410 |
9 | 128252624083814 |
10 | 30301201313032 |
11 | 9722738210641 |
12 | 34946ab016634 |
13 | 13ba511101b70 |
14 | 76a82bc80ab6 |
15 | 37830cb825a7 |
hex | 1b8f0c572d08 |
30301201313032 has 64 divisors (see below), whose sum is σ = 63262886400000. Its totient is φ = 13511737854720.
The previous prime is 30301201313011. The next prime is 30301201313057. The reversal of 30301201313032 is 23031310210303.
30301201313032 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 30301201312994 and 30301201313012.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5784907 + ... + 9698842.
It is an arithmetic number, because the mean of its divisors is an integer number (988482600000).
Almost surely, 230301201313032 is an apocalyptic number.
It is an amenable number.
30301201313032 is an abundant number, since it is smaller than the sum of its proper divisors (32961685086968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30301201313032 is a wasteful number, since it uses less digits than its factorization.
30301201313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15484406 (or 15484402 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 30301201313032 its reverse (23031310210303), we get a palindrome (53332511523335).
The spelling of 30301201313032 in words is "thirty trillion, three hundred one billion, two hundred one million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •