Base | Representation |
---|---|
bin | 1101101111001111000100… |
… | …10001011010111011011011 |
3 | 10221222002001211112011000002 |
4 | 12313213202101122323123 |
5 | 12424431144102212311 |
6 | 144130230520003215 |
7 | 6235423266235334 |
oct | 667474221327333 |
9 | 127862054464002 |
10 | 30210301210331 |
11 | 96981314a8020 |
12 | 347ab6090050b |
13 | 13b1a8597b548 |
14 | 7662875db28b |
15 | 375c8c7a893b |
hex | 1b79e245aedb |
30210301210331 has 8 divisors (see below), whose sum is σ = 32963769092784. Its totient is φ = 27458012805120.
The previous prime is 30210301210321. The next prime is 30210301210339. The reversal of 30210301210331 is 13301210301203.
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 30210301210331 - 218 = 30210300948187 is a prime.
It is a super-2 number, since 2×302103012103312 (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 (30210301210339) 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, 294815750 + ... + 294918203.
It is an arithmetic number, because the mean of its divisors is an integer number (4120471136598).
Almost surely, 230210301210331 is an apocalyptic number.
30210301210331 is a deficient number, since it is larger than the sum of its proper divisors (2753467882453).
30210301210331 is a wasteful number, since it uses less digits than its factorization.
30210301210331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589738621.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30210301210331 its reverse (13301210301203), we get a palindrome (43511511511534).
The spelling of 30210301210331 in words is "thirty trillion, two hundred ten billion, three hundred one million, two hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •