Base | Representation |
---|---|
bin | 1000001100110000… |
… | …1111001000110111 |
3 | 12200101121112222112 |
4 | 2003030033020313 |
5 | 14001430214111 |
6 | 1002223321235 |
7 | 105354246524 |
oct | 20314171067 |
9 | 5611545875 |
10 | 2201023031 |
11 | a2a4691a9 |
12 | 51515021b |
13 | 290ccc1bc |
14 | 16c46614b |
15 | cd36ee8b |
hex | 8330f237 |
2201023031 has 8 divisors (see below), whose sum is σ = 2333020320. Its totient is φ = 2069306368.
The previous prime is 2201023021. The next prime is 2201023043. The reversal of 2201023031 is 1303201022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2201023031 is a prime.
It is a super-2 number, since 2×22010230312 = 9689004765984853922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201022997 and 2201023015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201023001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53891 + ... + 85476.
It is an arithmetic number, because the mean of its divisors is an integer number (291627540).
Almost surely, 22201023031 is an apocalyptic number.
2201023031 is a deficient number, since it is larger than the sum of its proper divisors (131997289).
2201023031 is a wasteful number, since it uses less digits than its factorization.
2201023031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140313.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2201023031 is about 46915.0618778234. The cubic root of 2201023031 is about 1300.7930133940.
Adding to 2201023031 its reverse (1303201022), we get a palindrome (3504224053).
The spelling of 2201023031 in words is "two billion, two hundred one million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •