Base | Representation |
---|---|
bin | 1101110001111000001101… |
… | …11001011101110111010111 |
3 | 10222021202110110021200111111 |
4 | 12320330012321131313113 |
5 | 12432423133130013421 |
6 | 144240045431315451 |
7 | 6245116516230445 |
oct | 670740671356727 |
9 | 128252413250444 |
10 | 30301110001111 |
11 | 97226a0713644 |
12 | 349468451bb87 |
13 | 13ba4c8210a41 |
14 | 76a81dab1b95 |
15 | 378304b46ee1 |
hex | 1b8f06e5ddd7 |
30301110001111 has 8 divisors (see below), whose sum is σ = 30307560590880. Its totient is φ = 30294659744928.
The previous prime is 30301110001109. The next prime is 30301110001121. The reversal of 30301110001111 is 11110001110303.
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 30301110001111 - 21 = 30301110001109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30301110001091 and 30301110001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30301110001121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 272267385 + ... + 272378653.
It is an arithmetic number, because the mean of its divisors is an integer number (3788445073860).
Almost surely, 230301110001111 is an apocalyptic number.
30301110001111 is a deficient number, since it is larger than the sum of its proper divisors (6450589769).
30301110001111 is a wasteful number, since it uses less digits than its factorization.
30301110001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166793.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 30301110001111 its reverse (11110001110303), we get a palindrome (41411111111414).
The spelling of 30301110001111 in words is "thirty trillion, three hundred one billion, one hundred ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •