Base | Representation |
---|---|
bin | 1101101001011010100100… |
… | …01000011001111100111001 |
3 | 10221020221212102010012122201 |
4 | 12310231102020121330321 |
5 | 12413142110443313223 |
6 | 143454314221150201 |
7 | 6215113365540355 |
oct | 664552210317471 |
9 | 127227772105581 |
10 | 30010314432313 |
11 | 9620337147786 |
12 | 34482496bb361 |
13 | 1398c6430b637 |
14 | 75a71519c465 |
15 | 370985596ead |
hex | 1b4b52219f39 |
30010314432313 has 8 divisors (see below), whose sum is σ = 30751729708896. Its totient is φ = 29269349460000.
The previous prime is 30010314432269. The next prime is 30010314432331. The reversal of 30010314432313 is 31323441301003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30010314432313 - 241 = 27811291176761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30010314436313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112441131 + ... + 112707712.
It is an arithmetic number, because the mean of its divisors is an integer number (3843966213612).
Almost surely, 230010314432313 is an apocalyptic number.
It is an amenable number.
30010314432313 is a deficient number, since it is larger than the sum of its proper divisors (741415276583).
30010314432313 is a wasteful number, since it uses less digits than its factorization.
30010314432313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225152135.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 30010314432313 its reverse (31323441301003), we get a palindrome (61333755733316).
The spelling of 30010314432313 in words is "thirty trillion, ten billion, three hundred fourteen million, four hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •