Base | Representation |
---|---|
bin | 1101101001101100101000… |
… | …00010000011111101100111 |
3 | 10221021212220010001002110210 |
4 | 12310312110002003331213 |
5 | 12413321440030001411 |
6 | 143503000250550503 |
7 | 6215605555523256 |
oct | 664662402037547 |
9 | 127255803032423 |
10 | 30020010000231 |
11 | 9624462030429 |
12 | 344a0b4738433 |
13 | 1399b4ac08884 |
14 | 75ad94b1679d |
15 | 370d5186cca6 |
hex | 1b4d94083f67 |
30020010000231 has 16 divisors (see below), whose sum is σ = 41871127507200. Its totient is φ = 19095456124800.
The previous prime is 30020010000209. The next prime is 30020010000283. The reversal of 30020010000231 is 13200001002003.
It is a happy number.
It is not a de Polignac number, because 30020010000231 - 27 = 30020010000103 is a prime.
It is a super-2 number, since 2×300200100002312 (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 (30020010000031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 542456881 + ... + 542512218.
It is an arithmetic number, because the mean of its divisors is an integer number (2616945469200).
Almost surely, 230020010000231 is an apocalyptic number.
30020010000231 is a deficient number, since it is larger than the sum of its proper divisors (11851117506969).
30020010000231 is a wasteful number, since it uses less digits than its factorization.
30020010000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084969526.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 30020010000231 its reverse (13200001002003), we get a palindrome (43220011002234).
The spelling of 30020010000231 in words is "thirty trillion, twenty billion, ten million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •