Base | Representation |
---|---|
bin | 1101101100101010100110… |
… | …01010111101110001010111 |
3 | 10221122122011001011020102100 |
4 | 12312111103022331301113 |
5 | 12422004324230431411 |
6 | 144021504540413143 |
7 | 6226146160134045 |
oct | 666252312756127 |
9 | 127578131136370 |
10 | 30122001030231 |
11 | 966373a336870 |
12 | 3465a192471b3 |
13 | 13a6653071876 |
14 | 761cac379395 |
15 | 373820797456 |
hex | 1b65532bdc57 |
30122001030231 has 48 divisors (see below), whose sum is σ = 50428554976800. Its totient is φ = 17123248527360.
The previous prime is 30122001030217. The next prime is 30122001030239. The reversal of 30122001030231 is 13203010022103.
30122001030231 is a `hidden beast` number, since 301 + 2 + 20 + 0 + 10 + 302 + 31 = 666.
It is not a de Polignac number, because 30122001030231 - 29 = 30122001029719 is a prime.
It is a super-2 number, since 2×301220010302312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30122001030239) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30049206 + ... + 31035443.
It is an arithmetic number, because the mean of its divisors is an integer number (1050594895350).
Almost surely, 230122001030231 is an apocalyptic number.
30122001030231 is a deficient number, since it is larger than the sum of its proper divisors (20306553946569).
30122001030231 is a wasteful number, since it uses less digits than its factorization.
30122001030231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61084976 (or 61084973 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30122001030231 its reverse (13203010022103), we get a palindrome (43325011052334).
The spelling of 30122001030231 in words is "thirty trillion, one hundred twenty-two billion, one million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •