Base | Representation |
---|---|
bin | 111101010000000… |
… | …1010010000111001 |
3 | 12022020022120100110 |
4 | 1322200022100321 |
5 | 13202121013001 |
6 | 535535054533 |
7 | 101634226266 |
oct | 17240122071 |
9 | 5266276313 |
10 | 2055251001 |
11 | 965154551 |
12 | 494371449 |
13 | 269a5086b |
14 | 156d5c26d |
15 | c06783d6 |
hex | 7a80a439 |
2055251001 has 8 divisors (see below), whose sum is σ = 2751253344. Its totient is φ = 1364708000.
The previous prime is 2055250999. The next prime is 2055251021. The reversal of 2055251001 is 1001525502.
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 2055251001 - 21 = 2055250999 is a prime.
It is a super-2 number, since 2×20552510012 = 8448113354223004002, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2055251021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1363956 + ... + 1365461.
It is an arithmetic number, because the mean of its divisors is an integer number (343906668).
Almost surely, 22055251001 is an apocalyptic number.
It is an amenable number.
2055251001 is a deficient number, since it is larger than the sum of its proper divisors (696002343).
2055251001 is a wasteful number, since it uses less digits than its factorization.
2055251001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2729671.
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 2055251001 is about 45334.8762102644. The cubic root of 2055251001 is about 1271.4178063084.
Adding to 2055251001 its reverse (1001525502), we get a palindrome (3056776503).
The spelling of 2055251001 in words is "two billion, fifty-five million, two hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •