Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …11011111000010000100111 |
3 | 10221221012120201100020022011 |
4 | 12313133003323320100213 |
5 | 12424304030242442411 |
6 | 144122124003015051 |
7 | 6234651643001536 |
oct | 667370373702047 |
9 | 127835521306264 |
10 | 30201202312231 |
11 | 96942923a8225 |
12 | 347924166a487 |
13 | 13b0c65882182 |
14 | 765a6300031d |
15 | 375908a93c21 |
hex | 1b77c3ef8427 |
30201202312231 has 8 divisors (see below), whose sum is σ = 30514666178304. Its totient is φ = 29888994815160.
The previous prime is 30201202312207. The next prime is 30201202312241. The reversal of 30201202312231 is 13221320210203.
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 30201202312231 - 211 = 30201202310183 is a prime.
It is a super-2 number, since 2×302012023122312 (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 (30201202312241) 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, 314043925 + ... + 314140078.
It is an arithmetic number, because the mean of its divisors is an integer number (3814333272288).
Almost surely, 230201202312231 is an apocalyptic number.
30201202312231 is a deficient number, since it is larger than the sum of its proper divisors (313463866073).
30201202312231 is a wasteful number, since it uses less digits than its factorization.
30201202312231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628184501.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 30201202312231 its reverse (13221320210203), we get a palindrome (43422522522434).
The spelling of 30201202312231 in words is "thirty trillion, two hundred one billion, two hundred two million, three hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •