Base | Representation |
---|---|
bin | 111101010000000… |
… | …0000110110001111 |
3 | 12022020020121102221 |
4 | 1322200000312033 |
5 | 13202113244211 |
6 | 535534200211 |
7 | 101634005656 |
oct | 17240006617 |
9 | 5266217387 |
10 | 2055212431 |
11 | 965128578 |
12 | 494353067 |
13 | 269a3913c |
14 | 156d4c19d |
15 | c066bc71 |
hex | 7a800d8f |
2055212431 has 8 divisors (see below), whose sum is σ = 2096380800. Its totient is φ = 2014255320.
The previous prime is 2055212329. The next prime is 2055212443. The reversal of 2055212431 is 1342125502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2055212431 - 225 = 2021657999 is a prime.
It is a super-2 number, since 2×20552124312 = 8447796273073859522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2055212396 and 2055212405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2055212231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33091 + ... + 72148.
It is an arithmetic number, because the mean of its divisors is an integer number (262047600).
Almost surely, 22055212431 is an apocalyptic number.
2055212431 is a deficient number, since it is larger than the sum of its proper divisors (41168369).
2055212431 is a wasteful number, since it uses less digits than its factorization.
2055212431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105629.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 2055212431 is about 45334.4508183346. The cubic root of 2055212431 is about 1271.4098528773.
Adding to 2055212431 its reverse (1342125502), we get a palindrome (3397337933).
The spelling of 2055212431 in words is "two billion, fifty-five million, two hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •