Base | Representation |
---|---|
bin | 1101101111001110100010… |
… | …00011000011011010010001 |
3 | 10221222001022200202111022111 |
4 | 12313213101003003122101 |
5 | 12424430101112400223 |
6 | 144130142114105321 |
7 | 6235413160040035 |
oct | 667472103033221 |
9 | 127861280674274 |
10 | 30210012231313 |
11 | 9697aa3370892 |
12 | 347aa9bb7b241 |
13 | 13b1a3ab3bc45 |
14 | 76625b0961c5 |
15 | 375c7222530d |
hex | 1b79d10c3691 |
30210012231313 has 8 divisors (see below), whose sum is σ = 30219217472736. Its totient is φ = 30200807414400.
The previous prime is 30210012231247. The next prime is 30210012231361. The reversal of 30210012231313 is 31313221001203.
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 30210012231313 - 213 = 30210012223121 is a prime.
It is a super-3 number, since 3×302100122313133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30217012231313) 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, 196588878 + ... + 196742488.
It is an arithmetic number, because the mean of its divisors is an integer number (3777402184092).
Almost surely, 230210012231313 is an apocalyptic number.
It is an amenable number.
30210012231313 is a deficient number, since it is larger than the sum of its proper divisors (9205241423).
30210012231313 is a wasteful number, since it uses less digits than its factorization.
30210012231313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212255.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30210012231313 its reverse (31313221001203), we get a palindrome (61523233232516).
The spelling of 30210012231313 in words is "thirty trillion, two hundred ten billion, twelve million, two hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •