Base | Representation |
---|---|
bin | 1101101111001111000101… |
… | …10011110010110101001011 |
3 | 10221222002002110110221111102 |
4 | 12313213202303302311023 |
5 | 12424431203404034011 |
6 | 144130231441052015 |
7 | 6235423435645025 |
oct | 667474263626513 |
9 | 127862073427442 |
10 | 30210310221131 |
11 | 96981365a1a67 |
12 | 347ab6392700b |
13 | 13b1a877b4a91 |
14 | 7662888a5015 |
15 | 375c8d48873b |
hex | 1b79e2cf2d4b |
30210310221131 has 8 divisors (see below), whose sum is σ = 30216405661200. Its totient is φ = 30204215345920.
The previous prime is 30210310221029. The next prime is 30210310221149. The reversal of 30210310221131 is 13112201301203.
It is a happy number.
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 30210310221131 - 222 = 30210306026827 is a prime.
It is a super-2 number, since 2×302103102211312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30210310221631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116342000 + ... + 116601378.
It is an arithmetic number, because the mean of its divisors is an integer number (3777050707650).
Almost surely, 230210310221131 is an apocalyptic number.
30210310221131 is a deficient number, since it is larger than the sum of its proper divisors (6095440069).
30210310221131 is a wasteful number, since it uses less digits than its factorization.
30210310221131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282429.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 30210310221131 its reverse (13112201301203), we get a palindrome (43322511522334).
The spelling of 30210310221131 in words is "thirty trillion, two hundred ten billion, three hundred ten million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •