Base | Representation |
---|---|
bin | 1101101001011110010001… |
… | …00010111100100011111111 |
3 | 10221021010222212101110011222 |
4 | 12310233020202330203333 |
5 | 12413210143040220221 |
6 | 143455243310303555 |
7 | 6215213541130304 |
oct | 664571042744377 |
9 | 127233885343158 |
10 | 30012301101311 |
11 | 9621166609591 |
12 | 3448702ab7bbb |
13 | 13991bca98c19 |
14 | 75a862d870ab |
15 | 370a4ebc49ab |
hex | 1b4bc88bc8ff |
30012301101311 has 4 divisors (see below), whose sum is σ = 30012563407512. Its totient is φ = 30012038795112.
The previous prime is 30012301101301. The next prime is 30012301101313. The reversal of 30012301101311 is 11310110321003.
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 30012301101311 - 218 = 30012300839167 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 30012301101311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30012301101313) 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, 130981400 + ... + 131210333.
It is an arithmetic number, because the mean of its divisors is an integer number (7503140851878).
Almost surely, 230012301101311 is an apocalyptic number.
30012301101311 is a deficient number, since it is larger than the sum of its proper divisors (262306201).
30012301101311 is a wasteful number, since it uses less digits than its factorization.
30012301101311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262306200.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 30012301101311 its reverse (11310110321003), we get a palindrome (41322411422314).
The spelling of 30012301101311 in words is "thirty trillion, twelve billion, three hundred one million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •