Base | Representation |
---|---|
bin | 11101000100111110… |
… | …110111000000110110 |
3 | 2222120220220000102220 |
4 | 131010332313000312 |
5 | 1002420324200042 |
6 | 22202045543210 |
7 | 2153466320451 |
oct | 350476670066 |
9 | 88526800386 |
10 | 31222100022 |
11 | 12272074953 |
12 | 6074274b06 |
13 | 2c376267c9 |
14 | 172288c498 |
15 | c2b07c8ec |
hex | 744fb7036 |
31222100022 has 8 divisors (see below), whose sum is σ = 62444200056. Its totient is φ = 10407366672.
The previous prime is 31222099981. The next prime is 31222100029. The reversal of 31222100022 is 22000122213.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
31222100022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 31222099974 and 31222100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31222100029) 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 3 ways as a sum of consecutive naturals, for example, 2601841663 + ... + 2601841674.
It is an arithmetic number, because the mean of its divisors is an integer number (7805525007).
Almost surely, 231222100022 is an apocalyptic number.
31222100022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31222100022 is a wasteful number, since it uses less digits than its factorization.
31222100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5203683342.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 31222100022 its reverse (22000122213), we get a palindrome (53222222235).
The spelling of 31222100022 in words is "thirty-one billion, two hundred twenty-two million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •