Base | Representation |
---|---|
bin | 111111100000111… |
… | …1101111110000001 |
3 | 12111112021022112000 |
4 | 1333001331332001 |
5 | 13331043104101 |
6 | 551251254213 |
7 | 103546043250 |
oct | 17701757601 |
9 | 5445238460 |
10 | 2131222401 |
11 | 9a4023a30 |
12 | 4b58aa369 |
13 | 27c700359 |
14 | 163096797 |
15 | c7183486 |
hex | 7f07df81 |
2131222401 has 32 divisors (see below), whose sum is σ = 3936460800. Its totient is φ = 1107127440.
The previous prime is 2131222361. The next prime is 2131222411. The reversal of 2131222401 is 1042221312.
It is a happy number.
It is not a de Polignac number, because 2131222401 - 29 = 2131221889 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2131222411) 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 31 ways as a sum of consecutive naturals, for example, 510481 + ... + 514638.
It is an arithmetic number, because the mean of its divisors is an integer number (123014400).
Almost surely, 22131222401 is an apocalyptic number.
2131222401 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2131222401 is a deficient number, since it is larger than the sum of its proper divisors (1805238399).
2131222401 is a wasteful number, since it uses less digits than its factorization.
2131222401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1025146 (or 1025140 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 2131222401 is about 46165.1643666520. The cubic root of 2131222401 is about 1286.8944387749.
Adding to 2131222401 its reverse (1042221312), we get a palindrome (3173443713).
The spelling of 2131222401 in words is "two billion, one hundred thirty-one million, two hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •