Base | Representation |
---|---|
bin | 1101101001111111101011… |
… | …11111000010111000000111 |
3 | 10221022212022021211010221212 |
4 | 12310333311333002320013 |
5 | 12414003414241423421 |
6 | 143511411530202035 |
7 | 6216420265321001 |
oct | 664776577027007 |
9 | 127285267733855 |
10 | 30030243311111 |
11 | 962883350a34a |
12 | 345008b88331b |
13 | 139aabc044304 |
14 | 75b685c4d371 |
15 | 37124ee64e5b |
hex | 1b4ff5fc2e07 |
30030243311111 has 8 divisors (see below), whose sum is σ = 31803606155904. Its totient is φ = 28295855474040.
The previous prime is 30030243311099. The next prime is 30030243311113. The reversal of 30030243311111 is 11111334203003.
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 30030243311111 - 234 = 30013063441927 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30030243311113) 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, 9743750345 + ... + 9743753426.
It is an arithmetic number, because the mean of its divisors is an integer number (3975450769488).
Almost surely, 230030243311111 is an apocalyptic number.
30030243311111 is a deficient number, since it is larger than the sum of its proper divisors (1773362844793).
30030243311111 is a wasteful number, since it uses less digits than its factorization.
30030243311111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19487503861.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 30030243311111 its reverse (11111334203003), we get a palindrome (41141577514114).
The spelling of 30030243311111 in words is "thirty trillion, thirty billion, two hundred forty-three million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •