Base | Representation |
---|---|
bin | 101110010010010… |
… | …1100111100001011 |
3 | 11000020110221011000 |
4 | 1130210230330023 |
5 | 11140100001011 |
6 | 414040510043 |
7 | 53326226415 |
oct | 13444547413 |
9 | 4006427130 |
10 | 1553125131 |
11 | 727775998 |
12 | 37417b323 |
13 | 1b9a02c6c |
14 | 10a3b19b5 |
15 | 91540356 |
hex | 5c92cf0b |
1553125131 has 32 divisors (see below), whose sum is σ = 2386944000. Its totient is φ = 996909984.
The previous prime is 1553125129. The next prime is 1553125153. The reversal of 1553125131 is 1315213551.
It is not a de Polignac number, because 1553125131 - 21 = 1553125129 is a prime.
It is a super-2 number, since 2×15531251312 = 4824395345087534322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1553125095 and 1553125104.
It is not an unprimeable number, because it can be changed into a prime (1553125121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 297300 + ... + 302478.
It is an arithmetic number, because the mean of its divisors is an integer number (74592000).
Almost surely, 21553125131 is an apocalyptic number.
1553125131 is a deficient number, since it is larger than the sum of its proper divisors (833818869).
1553125131 is a wasteful number, since it uses less digits than its factorization.
1553125131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5600 (or 5594 counting only the distinct ones).
The product of its digits is 2250, while the sum is 27.
The square root of 1553125131 is about 39409.7085881132. The cubic root of 1553125131 is about 1158.0717894230.
Adding to 1553125131 its reverse (1315213551), we get a palindrome (2868338682).
The spelling of 1553125131 in words is "one billion, five hundred fifty-three million, one hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •