Base | Representation |
---|---|
bin | 1101101111001110111000… |
… | …11011100101001001001001 |
3 | 10221222001211000010020020210 |
4 | 12313213130123211021021 |
5 | 12424430444010212223 |
6 | 144130213055311333 |
7 | 6235420666243110 |
oct | 667473433451111 |
9 | 127861730106223 |
10 | 30210203210313 |
11 | 9698091152175 |
12 | 347ab33b1b549 |
13 | 13b1a6b588179 |
14 | 7662785aac77 |
15 | 375c83d9b893 |
hex | 1b79dc6e5249 |
30210203210313 has 16 divisors (see below), whose sum is σ = 46149394870656. Its totient is φ = 17219923449600.
The previous prime is 30210203210233. The next prime is 30210203210329. The reversal of 30210203210313 is 31301230201203.
It is not a de Polignac number, because 30210203210313 - 222 = 30210199016009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 30210203210313.
It is not an unprimeable number, because it can be changed into a prime (30210203211313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1793733606 + ... + 1793750447.
It is an arithmetic number, because the mean of its divisors is an integer number (2884337179416).
Almost surely, 230210203210313 is an apocalyptic number.
It is an amenable number.
30210203210313 is a deficient number, since it is larger than the sum of its proper divisors (15939191660343).
30210203210313 is a wasteful number, since it uses less digits than its factorization.
30210203210313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3587484464.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30210203210313 its reverse (31301230201203), we get a palindrome (61511433411516).
The spelling of 30210203210313 in words is "thirty trillion, two hundred ten billion, two hundred three million, two hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •