Base | Representation |
---|---|
bin | 1101110000001110000010… |
… | …11111100111000100011001 |
3 | 10222002022100002122110011121 |
4 | 12320013001133213010121 |
5 | 12431004414410122223 |
6 | 144153541445325241 |
7 | 6241031160002041 |
oct | 670070137470431 |
9 | 128068302573147 |
10 | 30244111020313 |
11 | 9700501232743 |
12 | 3485617706821 |
13 | 13b5013433c78 |
14 | 767b73a0c721 |
15 | 376abaada15d |
hex | 1b81c17e7119 |
30244111020313 has 4 divisors (see below), whose sum is σ = 30299401900240. Its totient is φ = 30188820140388.
The previous prime is 30244111020239. The next prime is 30244111020401. The reversal of 30244111020313 is 31302011144203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30244111020313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30244111020713) 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, 27645439143 + ... + 27645440236.
It is an arithmetic number, because the mean of its divisors is an integer number (7574850475060).
Almost surely, 230244111020313 is an apocalyptic number.
It is an amenable number.
30244111020313 is a deficient number, since it is larger than the sum of its proper divisors (55290879927).
30244111020313 is an equidigital number, since it uses as much as digits as its factorization.
30244111020313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55290879926.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30244111020313 its reverse (31302011144203), we get a palindrome (61546122164516).
The spelling of 30244111020313 in words is "thirty trillion, two hundred forty-four billion, one hundred eleven million, twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •