Base | Representation |
---|---|
bin | 111101001111101… |
… | …0011001100101110 |
3 | 12022012220002221212 |
4 | 1322133103030232 |
5 | 13202041303304 |
6 | 535530154422 |
7 | 101632266566 |
oct | 17237231456 |
9 | 5265802855 |
10 | 2055025454 |
11 | 965010049 |
12 | 494282a12 |
13 | 2699a1cc1 |
14 | 156cddda6 |
15 | c063166e |
hex | 7a7d332e |
2055025454 has 4 divisors (see below), whose sum is σ = 3082538184. Its totient is φ = 1027512726.
The previous prime is 2055025451. The next prime is 2055025457. The reversal of 2055025454 is 4545205502.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2055025451) and next prime (2055025457).
It is a super-2 number, since 2×20550254542 = 8446259233175812232, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2055025454.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2055025451) 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 as a sum of consecutive naturals, namely, 513756362 + ... + 513756365.
It is an arithmetic number, because the mean of its divisors is an integer number (770634546).
Almost surely, 22055025454 is an apocalyptic number.
2055025454 is a deficient number, since it is larger than the sum of its proper divisors (1027512730).
2055025454 is a wasteful number, since it uses less digits than its factorization.
2055025454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1027512729.
The product of its (nonzero) digits is 40000, while the sum is 32.
The square root of 2055025454 is about 45332.3885759398. The cubic root of 2055025454 is about 1271.3712953692.
The spelling of 2055025454 in words is "two billion, fifty-five million, twenty-five thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •