Base | Representation |
---|---|
bin | 1101101001101110111001… |
… | …10100101001011000000111 |
3 | 10221022000001012222111101011 |
4 | 12310313130310221120013 |
5 | 12413331440143021411 |
6 | 143503321353543051 |
7 | 6215651044651366 |
oct | 664673464513007 |
9 | 127260035874334 |
10 | 30021231220231 |
11 | 9624a29410059 |
12 | 344a395714a87 |
13 | 1399cb3c1c864 |
14 | 75b06cdab7dd |
15 | 370dc3b9ac21 |
hex | 1b4ddcd29607 |
30021231220231 has 4 divisors (see below), whose sum is σ = 30089616713200. Its totient is φ = 29952845727264.
The previous prime is 30021231220217. The next prime is 30021231220249. The reversal of 30021231220231 is 13202213212003.
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 30021231220231 - 27 = 30021231220103 is a prime.
It is a super-2 number, since 2×300212312202312 (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 (30021231220931) 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, 34192745826 + ... + 34192746703.
It is an arithmetic number, because the mean of its divisors is an integer number (7522404178300).
Almost surely, 230021231220231 is an apocalyptic number.
30021231220231 is a deficient number, since it is larger than the sum of its proper divisors (68385492969).
30021231220231 is an equidigital number, since it uses as much as digits as its factorization.
30021231220231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68385492968.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 30021231220231 its reverse (13202213212003), we get a palindrome (43223444432234).
The spelling of 30021231220231 in words is "thirty trillion, twenty-one billion, two hundred thirty-one million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •