Base | Representation |
---|---|
bin | 1101101100000010000001… |
… | …11111001101011000111111 |
3 | 10221120112221011102021020122 |
4 | 12312001000333031120333 |
5 | 12421130223101401421 |
6 | 144003503425405155 |
7 | 6224445353023460 |
oct | 666010077153077 |
9 | 127515834367218 |
10 | 30100221122111 |
11 | 96554831264a8 |
12 | 346175b1997bb |
13 | 13a45919c007a |
14 | 760c0392ad67 |
15 | 372e986412ab |
hex | 1b6040fcd63f |
30100221122111 has 8 divisors (see below), whose sum is σ = 34411468990080. Its totient is φ = 25791777323928.
The previous prime is 30100221121853. The next prime is 30100221122129. The reversal of 30100221122111 is 11122112200103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30100221122111 - 218 = 30100220859967 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30100221122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30100221122311) 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, 700994441 + ... + 701037378.
It is an arithmetic number, because the mean of its divisors is an integer number (4301433623760).
Almost surely, 230100221122111 is an apocalyptic number.
30100221122111 is a deficient number, since it is larger than the sum of its proper divisors (4311247867969).
30100221122111 is a wasteful number, since it uses less digits than its factorization.
30100221122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1402034893.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 30100221122111 its reverse (11122112200103), we get a palindrome (41222333322214).
The spelling of 30100221122111 in words is "thirty trillion, one hundred billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •