Base | Representation |
---|---|
bin | 1101101111110110001011… |
… | …11010010010100110001001 |
3 | 10222001002021021212102200212 |
4 | 12313323011322102212021 |
5 | 12430302200324040241 |
6 | 144144022333410505 |
7 | 6240065542003613 |
oct | 667730572224611 |
9 | 128032237772625 |
10 | 30231300221321 |
11 | 96a6027934861 |
12 | 3483041339a35 |
13 | 13b3a51308134 |
14 | 7672ba453db3 |
15 | 3765bb0acbeb |
hex | 1b7ec5e92989 |
30231300221321 has 4 divisors (see below), whose sum is σ = 30595532754192. Its totient is φ = 29867067688452.
The previous prime is 30231300221267. The next prime is 30231300221323. The reversal of 30231300221321 is 12312200313203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30231300221321 - 234 = 30214120352137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30231300221323) 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, 182116266311 + ... + 182116266476.
It is an arithmetic number, because the mean of its divisors is an integer number (7648883188548).
Almost surely, 230231300221321 is an apocalyptic number.
It is an amenable number.
30231300221321 is a deficient number, since it is larger than the sum of its proper divisors (364232532871).
30231300221321 is an equidigital number, since it uses as much as digits as its factorization.
30231300221321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364232532870.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30231300221321 its reverse (12312200313203), we get a palindrome (42543500534524).
The spelling of 30231300221321 in words is "thirty trillion, two hundred thirty-one billion, three hundred million, two hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •