Base | Representation |
---|---|
bin | 111111010000100… |
… | …0101111110010001 |
3 | 12110221001110220000 |
4 | 1332201011332101 |
5 | 13321341320213 |
6 | 550342440213 |
7 | 103412561055 |
oct | 17641057621 |
9 | 5427043800 |
10 | 2122604433 |
11 | 99a178144 |
12 | 4b2a33069 |
13 | 27a9a3871 |
14 | 161c91c65 |
15 | c652ec73 |
hex | 7e845f91 |
2122604433 has 20 divisors (see below), whose sum is σ = 3191821248. Its totient is φ = 1405690200.
The previous prime is 2122604417. The next prime is 2122604483. The reversal of 2122604433 is 3344062212.
2122604433 is a `hidden beast` number, since 2 + 1 + 22 + 604 + 4 + 33 = 666.
It is not a de Polignac number, because 2122604433 - 24 = 2122604417 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2122604397 and 2122604406.
It is not an unprimeable number, because it can be changed into a prime (2122604413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 74541 + ... + 99002.
Almost surely, 22122604433 is an apocalyptic number.
It is an amenable number.
2122604433 is a deficient number, since it is larger than the sum of its proper divisors (1069216815).
2122604433 is a wasteful number, since it uses less digits than its factorization.
2122604433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173706 (or 173697 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 2122604433 is about 46071.7313870447. The cubic root of 2122604433 is about 1285.1575017267.
Adding to 2122604433 its reverse (3344062212), we get a palindrome (5466666645).
The spelling of 2122604433 in words is "two billion, one hundred twenty-two million, six hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •