Base | Representation |
---|---|
bin | 1101110101001000111000… |
… | …11010000011010011100111 |
3 | 10222200110122000112000110122 |
4 | 12322210130122003103213 |
5 | 12441242102320424221 |
6 | 144403334215312155 |
7 | 6256163650514645 |
oct | 672443432032347 |
9 | 128613560460418 |
10 | 30413140014311 |
11 | 976615a73a70a |
12 | 34b232b07b65b |
13 | 13c7c40162c92 |
14 | 77200a724195 |
15 | 37b1b007eeab |
hex | 1ba91c6834e7 |
30413140014311 has 4 divisors (see below), whose sum is σ = 30419021500824. Its totient is φ = 30407258527800.
The previous prime is 30413140014307. The next prime is 30413140014359. The reversal of 30413140014311 is 11341004131403.
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 30413140014311 - 22 = 30413140014307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30413140014511) 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 3 ways as a sum of consecutive naturals, for example, 2940735500 + ... + 2940745841.
It is an arithmetic number, because the mean of its divisors is an integer number (7604755375206).
Almost surely, 230413140014311 is an apocalyptic number.
30413140014311 is a deficient number, since it is larger than the sum of its proper divisors (5881486513).
30413140014311 is an equidigital number, since it uses as much as digits as its factorization.
30413140014311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5881486512.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 30413140014311 its reverse (11341004131403), we get a palindrome (41754144145714).
The spelling of 30413140014311 in words is "thirty trillion, four hundred thirteen billion, one hundred forty million, fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •