Base | Representation |
---|---|
bin | 111111100011101… |
… | …0000101110011110 |
3 | 12111121212210212201 |
4 | 1333013100232132 |
5 | 13331422004300 |
6 | 551341122114 |
7 | 103563612502 |
oct | 17707205636 |
9 | 5447783781 |
10 | 2132609950 |
11 | 9a4891469 |
12 | 4b625933a |
13 | 27ca97aa3 |
14 | 163338302 |
15 | c735966a |
hex | 7f1d0b9e |
2132609950 has 48 divisors (see below), whose sum is σ = 4020773904. Its totient is φ = 841472000.
The previous prime is 2132609923. The next prime is 2132609987. The reversal of 2132609950 is 599062312.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1751742 + ... + 1752958.
It is an arithmetic number, because the mean of its divisors is an integer number (83766123).
Almost surely, 22132609950 is an apocalyptic number.
2132609950 is a deficient number, since it is larger than the sum of its proper divisors (1888163954).
2132609950 is a wasteful number, since it uses less digits than its factorization.
2132609950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1677 (or 1672 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 37.
The square root of 2132609950 is about 46180.1900169326. The cubic root of 2132609950 is about 1287.1736590813.
The spelling of 2132609950 in words is "two billion, one hundred thirty-two million, six hundred nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •