Base | Representation |
---|---|
bin | 10010101000110111… |
… | …100101010100000111 |
3 | 1220122202000100200020 |
4 | 102220313211110013 |
5 | 311441312342411 |
6 | 13105512150223 |
7 | 1305640540302 |
oct | 225067452407 |
9 | 56582010606 |
10 | 20013012231 |
11 | 853a907333 |
12 | 3a66398373 |
13 | 1b6c2b2594 |
14 | d7bd11b39 |
15 | 7c1e8b606 |
hex | 4a8de5507 |
20013012231 has 4 divisors (see below), whose sum is σ = 26684016312. Its totient is φ = 13342008152.
The previous prime is 20013012211. The next prime is 20013012277. The reversal of 20013012231 is 13221031002.
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 20013012231 - 25 = 20013012199 is a prime.
It is a super-2 number, since 2×200130122312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20013012231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013012211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3335502036 + ... + 3335502041.
It is an arithmetic number, because the mean of its divisors is an integer number (6671004078).
Almost surely, 220013012231 is an apocalyptic number.
20013012231 is a deficient number, since it is larger than the sum of its proper divisors (6671004081).
20013012231 is an equidigital number, since it uses as much as digits as its factorization.
20013012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6671004080.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20013012231 its reverse (13221031002), we get a palindrome (33234043233).
The spelling of 20013012231 in words is "twenty billion, thirteen million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •