Base | Representation |
---|---|
bin | 1001001001010100… |
… | …1010010111011111 |
3 | 20100002112222201120 |
4 | 2102111022113133 |
5 | 20011441133043 |
6 | 1043335342023 |
7 | 114560222460 |
oct | 22225122737 |
9 | 6302488646 |
10 | 2455021023 |
11 | 104a8826a4 |
12 | 586221913 |
13 | 301811580 |
14 | 1940a2d67 |
15 | e57e3983 |
hex | 9254a5df |
2455021023 has 32 divisors (see below), whose sum is σ = 4032946176. Its totient is φ = 1293608448.
The previous prime is 2455021021. The next prime is 2455021033. The reversal of 2455021023 is 3201205542.
It is not a de Polignac number, because 2455021023 - 21 = 2455021021 is a prime.
It is a super-3 number, since 3×24550210233 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2455020984 and 2455021002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2455021021) 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, 292615 + ... + 300887.
It is an arithmetic number, because the mean of its divisors is an integer number (126029568).
Almost surely, 22455021023 is an apocalyptic number.
2455021023 is a deficient number, since it is larger than the sum of its proper divisors (1577925153).
2455021023 is a wasteful number, since it uses less digits than its factorization.
2455021023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9383.
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 2455021023 is about 49548.1687148980. The cubic root of 2455021023 is about 1349.0200520776.
Adding to 2455021023 its reverse (3201205542), we get a palindrome (5656226565).
The spelling of 2455021023 in words is "two billion, four hundred fifty-five million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •