Base | Representation |
---|---|
bin | 111111100000110… |
… | …1000000000000110 |
3 | 12111112002202002110 |
4 | 1333001220000012 |
5 | 13331032214142 |
6 | 551245321450 |
7 | 103545220026 |
oct | 17701500006 |
9 | 5445082073 |
10 | 2131132422 |
11 | 9a3a72371 |
12 | 4b5866286 |
13 | 27c69b403 |
14 | 163071a86 |
15 | c716699c |
hex | 7f068006 |
2131132422 has 8 divisors (see below), whose sum is σ = 4262264856. Its totient is φ = 710377472.
The previous prime is 2131132411. The next prime is 2131132433. The reversal of 2131132422 is 2242311312.
It is an interprime number because it is at equal distance from previous prime (2131132411) and next prime (2131132433).
It is a sphenic number, since it is the product of 3 distinct primes.
2131132422 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 177594363 + ... + 177594374.
It is an arithmetic number, because the mean of its divisors is an integer number (532783107).
Almost surely, 22131132422 is an apocalyptic number.
2131132422 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.
2131132422 is a wasteful number, since it uses less digits than its factorization.
2131132422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355188742.
The product of its digits is 576, while the sum is 21.
The square root of 2131132422 is about 46164.1898228486. The cubic root of 2131132422 is about 1286.8763278691.
Adding to 2131132422 its reverse (2242311312), we get a palindrome (4373443734).
It can be divided in two parts, 2131 and 132422, that multiplied together give a palindrome (282191282).
The spelling of 2131132422 in words is "two billion, one hundred thirty-one million, one hundred thirty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •