Base | Representation |
---|---|
bin | 101110111000111010110… |
… | …100011101100010011001 |
3 | 102102001002111220212101110 |
4 | 232320322310131202121 |
5 | 410243042322144001 |
6 | 10504133000210533 |
7 | 451540265445006 |
oct | 56707264354231 |
9 | 12361074825343 |
10 | 3222212303001 |
11 | 103259492998a |
12 | 4405a0469a49 |
13 | 1a4b12975223 |
14 | b1d550208ad |
15 | 58c3cc813d6 |
hex | 2ee3ad1d899 |
3222212303001 has 24 divisors (see below), whose sum is σ = 4646068519680. Its totient is φ = 1983890804896.
The previous prime is 3222212302987. The next prime is 3222212303003. The reversal of 3222212303001 is 1003032122223.
It is a happy number.
It is not a de Polignac number, because 3222212303001 - 210 = 3222212301977 is a prime.
It is a super-2 number, since 2×32222123030012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3222212303003) 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 23 ways as a sum of consecutive naturals, for example, 34960521 + ... + 35052566.
It is an arithmetic number, because the mean of its divisors is an integer number (193586188320).
Almost surely, 23222212303001 is an apocalyptic number.
It is an amenable number.
3222212303001 is a deficient number, since it is larger than the sum of its proper divisors (1423856216679).
3222212303001 is a wasteful number, since it uses less digits than its factorization.
3222212303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70013165 (or 70013142 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3222212303001 its reverse (1003032122223), we get a palindrome (4225244425224).
The spelling of 3222212303001 in words is "three trillion, two hundred twenty-two billion, two hundred twelve million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •