Base | Representation |
---|---|
bin | 1101110010001001001010… |
… | …10011001110010010010001 |
3 | 10222022121221122112201211201 |
4 | 12321010211103032102101 |
5 | 12433100302230112423 |
6 | 144244152424111201 |
7 | 6245561155045444 |
oct | 671044523162221 |
9 | 128277848481751 |
10 | 30310210004113 |
11 | 97265403a8586 |
12 | 34963a4005501 |
13 | 13bb318605cc0 |
14 | 76b0444b965b |
15 | 3786889c92ad |
hex | 1b91254ce491 |
30310210004113 has 4 divisors (see below), whose sum is σ = 32641764619828. Its totient is φ = 27978655388400.
The previous prime is 30310210004089. The next prime is 30310210004119. The reversal of 30310210004113 is 31140001201303.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13305737176209 + 17004472827904 = 3647703^2 + 4123648^2 .
It is a cyclic number.
It is not a de Polignac number, because 30310210004113 - 213 = 30310209995921 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30310210004119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1165777307838 + ... + 1165777307863.
It is an arithmetic number, because the mean of its divisors is an integer number (8160441154957).
Almost surely, 230310210004113 is an apocalyptic number.
It is an amenable number.
30310210004113 is a deficient number, since it is larger than the sum of its proper divisors (2331554615715).
30310210004113 is a wasteful number, since it uses less digits than its factorization.
30310210004113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2331554615714.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30310210004113 its reverse (31140001201303), we get a palindrome (61450211205416).
The spelling of 30310210004113 in words is "thirty trillion, three hundred ten billion, two hundred ten million, four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •