Base | Representation |
---|---|
bin | 1101101110111110001010… |
… | …00011010000010111111111 |
3 | 10221221012122000112211222011 |
4 | 12313133011003100113333 |
5 | 12424304100040220411 |
6 | 144122125512032051 |
7 | 6234652261021546 |
oct | 667370503202777 |
9 | 127835560484864 |
10 | 30201221023231 |
11 | 96942a1a18065 |
12 | 3479247992627 |
13 | 13b0c6970397b |
14 | 765a656b115d |
15 | 37590a53cc21 |
hex | 1b77c50d05ff |
30201221023231 has 4 divisors (see below), whose sum is σ = 30227011990264. Its totient is φ = 30175430056200.
The previous prime is 30201221023177. The next prime is 30201221023241. The reversal of 30201221023231 is 13232012210203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30201221023231 - 217 = 30201220892159 is a prime.
It is a super-2 number, since 2×302012210232312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201221023241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12895481760 + ... + 12895484101.
It is an arithmetic number, because the mean of its divisors is an integer number (7556752997566).
Almost surely, 230201221023231 is an apocalyptic number.
30201221023231 is a deficient number, since it is larger than the sum of its proper divisors (25790967033).
30201221023231 is a wasteful number, since it uses less digits than its factorization.
30201221023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25790967032.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 30201221023231 its reverse (13232012210203), we get a palindrome (43433233233434).
The spelling of 30201221023231 in words is "thirty trillion, two hundred one billion, two hundred twenty-one million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •