Base | Representation |
---|---|
bin | 101110110110111000010… |
… | …010000000001111001001 |
3 | 102101211102212220201210000 |
4 | 232312320102000033021 |
5 | 410224101142411014 |
6 | 10503131403313213 |
7 | 451432103241252 |
oct | 56667022001711 |
9 | 12354385821700 |
10 | 3220022232009 |
11 | 1031670671160 |
12 | 44008ab1b809 |
13 | 1a485400c02b |
14 | b1bc8209b29 |
15 | 58b60876509 |
hex | 2edb84803c9 |
3220022232009 has 40 divisors (see below), whose sum is σ = 5346452086272. Its totient is φ = 1914707302560.
The previous prime is 3220022231999. The next prime is 3220022232047. The reversal of 3220022232009 is 9002322200223.
3220022232009 is a `hidden beast` number, since 32 + 200 + 2 + 223 + 200 + 9 = 666.
3220022232009 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3220022232009 - 25 = 3220022231977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3220022237009) 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 39 ways as a sum of consecutive naturals, for example, 34046569 + ... + 34141014.
Almost surely, 23220022232009 is an apocalyptic number.
It is an amenable number.
3220022232009 is a deficient number, since it is larger than the sum of its proper divisors (2126429854263).
3220022232009 is a wasteful number, since it uses less digits than its factorization.
3220022232009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68187659 (or 68187650 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The spelling of 3220022232009 in words is "three trillion, two hundred twenty billion, twenty-two million, two hundred thirty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •