Base | Representation |
---|---|
bin | 100010010111011… |
… | …0100101010001101 |
3 | 2222100210211010112 |
4 | 1010232310222031 |
5 | 4330200000010 |
6 | 310231245405 |
7 | 40401254324 |
oct | 10456645215 |
9 | 2870724115 |
10 | 1153125005 |
11 | 5419aa97a |
12 | 282219865 |
13 | 154b915b6 |
14 | ad20b0bb |
15 | 6b37ba05 |
hex | 44bb4a8d |
1153125005 has 4 divisors (see below), whose sum is σ = 1383750012. Its totient is φ = 922500000.
The previous prime is 1153124971. The next prime is 1153125019. The reversal of 1153125005 is 5005213511.
It is a happy number.
1153125005 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 151339204 + 1001785801 = 12302^2 + 31651^2 .
It is not a de Polignac number, because 1153125005 - 218 = 1152862861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 115312496 + ... + 115312505.
It is an arithmetic number, because the mean of its divisors is an integer number (345937503).
Almost surely, 21153125005 is an apocalyptic number.
It is an amenable number.
1153125005 is a deficient number, since it is larger than the sum of its proper divisors (230625007).
1153125005 is an equidigital number, since it uses as much as digits as its factorization.
1153125005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230625006.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 1153125005 is about 33957.6943416363. The cubic root of 1153125005 is about 1048.6376905470.
Adding to 1153125005 its reverse (5005213511), we get a palindrome (6158338516).
The spelling of 1153125005 in words is "one billion, one hundred fifty-three million, one hundred twenty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •