Base | Representation |
---|---|
bin | 1101110110001111011011… |
… | …01100111000001111000011 |
3 | 10222211002101022200211111201 |
4 | 12323013231230320033003 |
5 | 12442402132322014321 |
6 | 144433000144522031 |
7 | 6262004304613624 |
oct | 673075554701703 |
9 | 128732338624451 |
10 | 30451011126211 |
11 | 9780223a195a5 |
12 | 34b973a020317 |
13 | 13cb697151830 |
14 | 773ba0285a4b |
15 | 37c179be5291 |
hex | 1bb1edb383c3 |
30451011126211 has 8 divisors (see below), whose sum is σ = 32793951004640. Its totient is φ = 28108150448832.
The previous prime is 30451011126199. The next prime is 30451011126241. The reversal of 30451011126211 is 11262111015403.
It is a happy number.
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 30451011126211 - 27 = 30451011126083 is a prime.
It is a super-2 number, since 2×304510111262112 (a number of 28 digits) contains 22 as substring.
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 30451011126211.
It is not an unprimeable number, because it can be changed into a prime (30451011126241) 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, 19000530 + ... + 20540743.
It is an arithmetic number, because the mean of its divisors is an integer number (4099243875580).
Almost surely, 230451011126211 is an apocalyptic number.
30451011126211 is a deficient number, since it is larger than the sum of its proper divisors (2342939878429).
30451011126211 is a wasteful number, since it uses less digits than its factorization.
30451011126211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39600525.
The product of its (nonzero) digits is 1440, while the sum is 28.
The spelling of 30451011126211 in words is "thirty trillion, four hundred fifty-one billion, eleven million, one hundred twenty-six thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •