Base | Representation |
---|---|
bin | 1101101001100000001010… |
… | …11101100110101110011011 |
3 | 10221021020122002110221100122 |
4 | 12310300011131212232123 |
5 | 12413214241204030243 |
6 | 143455532535423455 |
7 | 6215251061101316 |
oct | 664600535465633 |
9 | 127236562427318 |
10 | 30013323111323 |
11 | 96216404a5862 |
12 | 3448949224b8b |
13 | 1399323741386 |
14 | 75a91c9c397d |
15 | 370aae7a2668 |
hex | 1b4c05766b9b |
30013323111323 has 4 divisors (see below), whose sum is σ = 30023432013960. Its totient is φ = 30003214208688.
The previous prime is 30013323111269. The next prime is 30013323111349. The reversal of 30013323111323 is 32311132331003.
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 30013323111323 - 218 = 30013322849179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30013323111292 and 30013323111301.
It is not an unprimeable number, because it can be changed into a prime (30013323111353) 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, 5054446865 + ... + 5054452802.
It is an arithmetic number, because the mean of its divisors is an integer number (7505858003490).
Almost surely, 230013323111323 is an apocalyptic number.
30013323111323 is a deficient number, since it is larger than the sum of its proper divisors (10108902637).
30013323111323 is a wasteful number, since it uses less digits than its factorization.
30013323111323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10108902636.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 30013323111323 its reverse (32311132331003), we get a palindrome (62324455442326).
The spelling of 30013323111323 in words is "thirty trillion, thirteen billion, three hundred twenty-three million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •