Base | Representation |
---|---|
bin | 101110111001110101110… |
… | …000001010001101101110 |
3 | 102102010122102101110020210 |
4 | 232321311300022031232 |
5 | 410302103430443042 |
6 | 10504415040123250 |
7 | 451603632501000 |
oct | 56716560121556 |
9 | 12363572343223 |
10 | 3223201031022 |
11 | 1032a51a53985 |
12 | 440817606526 |
13 | 1a4c3c7668ab |
14 | b200a476370 |
15 | 58c99987a9c |
hex | 2ee75c0a36e |
3223201031022 has 64 divisors (see below), whose sum is σ = 7518298636800. Its totient is φ = 920837578752.
The previous prime is 3223201031009. The next prime is 3223201031053. The reversal of 3223201031022 is 2201301023223.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 3223201031022.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 27339333 + ... + 27456975.
It is an arithmetic number, because the mean of its divisors is an integer number (117473416200).
Almost surely, 23223201031022 is an apocalyptic number.
3223201031022 is an abundant number, since it is smaller than the sum of its proper divisors (4295097605778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3223201031022 is a wasteful number, since it uses less digits than its factorization.
3223201031022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130982 (or 130968 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3223201031022 its reverse (2201301023223), we get a palindrome (5424502054245).
The spelling of 3223201031022 in words is "three trillion, two hundred twenty-three billion, two hundred one million, thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •