Base | Representation |
---|---|
bin | 1001100001001110… |
… | …1100100010111111 |
3 | 20121002020200122220 |
4 | 2120103230202333 |
5 | 20213124100111 |
6 | 1101320540423 |
7 | 120215456214 |
oct | 23023544277 |
9 | 6532220586 |
10 | 2555300031 |
11 | 10a1444809 |
12 | 5b3921713 |
13 | 31952206b |
14 | 1a3527b0b |
15 | ee500e06 |
hex | 984ec8bf |
2555300031 has 32 divisors (see below), whose sum is σ = 3595468800. Its totient is φ = 1612120320.
The previous prime is 2555300021. The next prime is 2555300047. The reversal of 2555300031 is 1300035552.
It is not a de Polignac number, because 2555300031 - 210 = 2555299007 is a prime.
It is a super-2 number, since 2×25553000312 = 13059116496857201922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2555299974 and 2555300010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2555300021) 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 31 ways as a sum of consecutive naturals, for example, 1997250 + ... + 1998528.
It is an arithmetic number, because the mean of its divisors is an integer number (112358400).
Almost surely, 22555300031 is an apocalyptic number.
2555300031 is a deficient number, since it is larger than the sum of its proper divisors (1040168769).
2555300031 is a wasteful number, since it uses less digits than its factorization.
2555300031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1799.
The product of its (nonzero) digits is 2250, while the sum is 24.
The square root of 2555300031 is about 50549.9755786291. The cubic root of 2555300031 is about 1367.1430742887.
Adding to 2555300031 its reverse (1300035552), we get a palindrome (3855335583).
The spelling of 2555300031 in words is "two billion, five hundred fifty-five million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •