Base | Representation |
---|---|
bin | 11100001110110110… |
… | …110110111101110011 |
3 | 2220020122012102200101 |
4 | 130032312312331303 |
5 | 444040343024021 |
6 | 21532010533231 |
7 | 2122132012663 |
oct | 341666667563 |
9 | 86218172611 |
10 | 30314033011 |
11 | 11946532749 |
12 | 5a60137217 |
13 | 2b21467352 |
14 | 16780321a3 |
15 | bc64aaa91 |
hex | 70edb6f73 |
30314033011 has 8 divisors (see below), whose sum is σ = 30889084320. Its totient is φ = 29739096192.
The previous prime is 30314032997. The next prime is 30314033017. The reversal of 30314033011 is 11033041303.
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 30314033011 - 223 = 30305644403 is a prime.
It is a super-2 number, since 2×303140330112 (a number of 22 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 30314033011.
It is not an unprimeable number, because it can be changed into a prime (30314033017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 662571 + ... + 706843.
It is an arithmetic number, because the mean of its divisors is an integer number (3861135540).
Almost surely, 230314033011 is an apocalyptic number.
30314033011 is a deficient number, since it is larger than the sum of its proper divisors (575051309).
30314033011 is a wasteful number, since it uses less digits than its factorization.
30314033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57245.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30314033011 its reverse (11033041303), we get a palindrome (41347074314).
The spelling of 30314033011 in words is "thirty billion, three hundred fourteen million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •