Base | Representation |
---|---|
bin | 1101111000100010110100… |
… | …10010011011011010110111 |
3 | 11000002122122002222222212101 |
4 | 12330101122102123122313 |
5 | 13000201212413222221 |
6 | 144533204225002531 |
7 | 6300505246640464 |
oct | 674213222333267 |
9 | 130078562888771 |
10 | 30530142320311 |
11 | 9800840469977 |
12 | 3510b42a83447 |
13 | 1405c982925ca |
14 | 7779498a466b |
15 | 37e25bc99d91 |
hex | 1bc45a49b6b7 |
30530142320311 has 4 divisors (see below), whose sum is σ = 30530266918272. Its totient is φ = 30530017722352.
The previous prime is 30530142320309. The next prime is 30530142320351. The reversal of 30530142320311 is 11302324103503.
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 30530142320311 - 21 = 30530142320309 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 30530142320311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30530142320351) 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, 61930711 + ... + 62421736.
It is an arithmetic number, because the mean of its divisors is an integer number (7632566729568).
Almost surely, 230530142320311 is an apocalyptic number.
30530142320311 is a deficient number, since it is larger than the sum of its proper divisors (124597961).
30530142320311 is a wasteful number, since it uses less digits than its factorization.
30530142320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124597960.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 30530142320311 its reverse (11302324103503), we get a palindrome (41832466423814).
The spelling of 30530142320311 in words is "thirty trillion, five hundred thirty billion, one hundred forty-two million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •