Base | Representation |
---|---|
bin | 11100001001111010… |
… | …111000100011100111 |
3 | 2220000212100011221000 |
4 | 130021322320203213 |
5 | 443403141431043 |
6 | 21515451324343 |
7 | 2120104656141 |
oct | 341172704347 |
9 | 86025304830 |
10 | 30231202023 |
11 | 119037a8590 |
12 | 5a384506b3 |
13 | 2b0a255529 |
14 | 166b02dc91 |
15 | bbe0982d3 |
hex | 709eb88e7 |
30231202023 has 16 divisors (see below), whose sum is σ = 48858508800. Its totient is φ = 18321940440.
The previous prime is 30231202019. The next prime is 30231202033. The reversal of 30231202023 is 32020213203.
It is a happy number.
It is not a de Polignac number, because 30231202023 - 22 = 30231202019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30231201987 and 30231202005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30231202033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50893983 + ... + 50894576.
It is an arithmetic number, because the mean of its divisors is an integer number (3053656800).
Almost surely, 230231202023 is an apocalyptic number.
30231202023 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30231202023 is a deficient number, since it is larger than the sum of its proper divisors (18627306777).
30231202023 is a wasteful number, since it uses less digits than its factorization.
30231202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101788579 (or 101788573 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 30231202023 its reverse (32020213203), we get a palindrome (62251415226).
The spelling of 30231202023 in words is "thirty billion, two hundred thirty-one million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •