Base | Representation |
---|---|
bin | 1101101100010110100010… |
… | …10011001011010111111111 |
3 | 10221121121100112201111210120 |
4 | 12312023101103023113333 |
5 | 12421320300421213211 |
6 | 144012524211310023 |
7 | 6225315255521001 |
oct | 666132123132777 |
9 | 127547315644716 |
10 | 30111232210431 |
11 | 965a113648099 |
12 | 34639128ab313 |
13 | 13a5627cca748 |
14 | 76156a086371 |
15 | 3733e0170d06 |
hex | 1b62d14cb5ff |
30111232210431 has 4 divisors (see below), whose sum is σ = 40148309613912. Its totient is φ = 20074154806952.
The previous prime is 30111232210429. The next prime is 30111232210439. The reversal of 30111232210431 is 13401223211103.
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 30111232210431 - 21 = 30111232210429 is a prime.
It is a super-2 number, since 2×301112322104312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30111232210439) 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, 5018538701736 + ... + 5018538701741.
It is an arithmetic number, because the mean of its divisors is an integer number (10037077403478).
Almost surely, 230111232210431 is an apocalyptic number.
30111232210431 is a deficient number, since it is larger than the sum of its proper divisors (10037077403481).
30111232210431 is a wasteful number, since it uses less digits than its factorization.
30111232210431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10037077403480.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 30111232210431 its reverse (13401223211103), we get a palindrome (43512455421534).
The spelling of 30111232210431 in words is "thirty trillion, one hundred eleven billion, two hundred thirty-two million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •