Base | Representation |
---|---|
bin | 11101001011011010… |
… | …111011100111101101 |
3 | 2222212110011010001002 |
4 | 131023122323213231 |
5 | 1003131002402341 |
6 | 22220505130045 |
7 | 2156250434126 |
oct | 351332734755 |
9 | 88773133032 |
10 | 31330122221 |
11 | 123180455a2 |
12 | 60a4489925 |
13 | 2c53b18878 |
14 | 1732d6b04d |
15 | c357b929b |
hex | 74b6bb9ed |
31330122221 has 8 divisors (see below), whose sum is σ = 33228242304. Its totient is φ = 29476663920.
The previous prime is 31330122209. The next prime is 31330122277. The reversal of 31330122221 is 12222103313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31330122221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31330122193 and 31330122202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31320122221) 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 7 ways as a sum of consecutive naturals, for example, 11164001 + ... + 11166806.
It is an arithmetic number, because the mean of its divisors is an integer number (4153530288).
Almost surely, 231330122221 is an apocalyptic number.
It is an amenable number.
31330122221 is a deficient number, since it is larger than the sum of its proper divisors (1898120083).
31330122221 is a wasteful number, since it uses less digits than its factorization.
31330122221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22330891.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 31330122221 its reverse (12222103313), we get a palindrome (43552225534).
The spelling of 31330122221 in words is "thirty-one billion, three hundred thirty million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •