Base | Representation |
---|---|
bin | 1000011001101101… |
… | …0101000100000110 |
3 | 12211011202200020010 |
4 | 2012123111010012 |
5 | 14104324423420 |
6 | 1011443051050 |
7 | 106613554023 |
oct | 20633250406 |
9 | 5734680203 |
10 | 2255311110 |
11 | a58078688 |
12 | 52b370a86 |
13 | 29c329320 |
14 | 17575854a |
15 | d2ee54e0 |
hex | 866d5106 |
2255311110 has 64 divisors (see below), whose sum is σ = 5889304512. Its totient is φ = 549421056.
The previous prime is 2255311099. The next prime is 2255311111. The reversal of 2255311110 is 111135522.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2255311111) 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 31 ways as a sum of consecutive naturals, for example, 8022 + ... + 67638.
It is an arithmetic number, because the mean of its divisors is an integer number (92020383).
Almost surely, 22255311110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2255311110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2944652256).
2255311110 is an abundant number, since it is smaller than the sum of its proper divisors (3633993402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2255311110 is a wasteful number, since it uses less digits than its factorization.
2255311110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59737.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 2255311110 is about 47490.1159189994. The cubic root of 2255311110 is about 1311.4009273435.
Adding to 2255311110 its reverse (111135522), we get a palindrome (2366446632).
The spelling of 2255311110 in words is "two billion, two hundred fifty-five million, three hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •