Base | Representation |
---|---|
bin | 100010010111111… |
… | …1100101101011101 |
3 | 2222101100210221220 |
4 | 1010233330231131 |
5 | 4330233421000 |
6 | 310241443553 |
7 | 40403623614 |
oct | 10457745535 |
9 | 2871323856 |
10 | 1153420125 |
11 | 542091680 |
12 | 2823405b9 |
13 | 154c65a20 |
14 | ad28687b |
15 | 6b3d91a0 |
hex | 44bfcb5d |
1153420125 has 128 divisors (see below), whose sum is σ = 2285756928. Its totient is φ = 509184000.
The previous prime is 1153420057. The next prime is 1153420139. The reversal of 1153420125 is 5210243511.
It is a happy number.
It is not a de Polignac number, because 1153420125 - 29 = 1153419613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1153420095 and 1153420104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 7346547 + ... + 7346703.
It is an arithmetic number, because the mean of its divisors is an integer number (17857476).
Almost surely, 21153420125 is an apocalyptic number.
1153420125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1153420125 is a deficient number, since it is larger than the sum of its proper divisors (1132336803).
1153420125 is a wasteful number, since it uses less digits than its factorization.
1153420125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336 (or 326 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1153420125 is about 33962.0394705618. The cubic root of 1153420125 is about 1048.7271424151.
Adding to 1153420125 its reverse (5210243511), we get a palindrome (6363663636).
The spelling of 1153420125 in words is "one billion, one hundred fifty-three million, four hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •