Base | Representation |
---|---|
bin | 1101101101001100100010… |
… | …10010110100000100010011 |
3 | 10221201101011222021112112201 |
4 | 12312212101102310010103 |
5 | 12422304134111103321 |
6 | 144034121035504031 |
7 | 6230362553425555 |
oct | 666462122640423 |
9 | 127641158245481 |
10 | 30140223144211 |
11 | 96704402357a4 |
12 | 34694638b8017 |
13 | 13a82982ccb2b |
14 | 762b1a4a34d5 |
15 | 37403a3c7291 |
hex | 1b69914b4113 |
30140223144211 has 4 divisors (see below), whose sum is σ = 30149359317000. Its totient is φ = 30131086971424.
The previous prime is 30140223144197. The next prime is 30140223144221. The reversal of 30140223144211 is 11244132204103.
It is a happy number.
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 30140223144211 - 211 = 30140223142163 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30140223144211.
It is not an unprimeable number, because it can be changed into a prime (30140223144221) 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, 4568081446 + ... + 4568088043.
It is an arithmetic number, because the mean of its divisors is an integer number (7537339829250).
Almost surely, 230140223144211 is an apocalyptic number.
30140223144211 is a deficient number, since it is larger than the sum of its proper divisors (9136172789).
30140223144211 is an equidigital number, since it uses as much as digits as its factorization.
30140223144211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9136172788.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 30140223144211 its reverse (11244132204103), we get a palindrome (41384355348314).
The spelling of 30140223144211 in words is "thirty trillion, one hundred forty billion, two hundred twenty-three million, one hundred forty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •