Base | Representation |
---|---|
bin | 100010010111001… |
… | …1010001001100111 |
3 | 2222100121022011222 |
4 | 1010232122021213 |
5 | 4330133011143 |
6 | 310225050555 |
7 | 40400322626 |
oct | 10456321147 |
9 | 2870538158 |
10 | 1153016423 |
11 | 541936339 |
12 | 282186a5b |
13 | 154b54050 |
14 | ad1bd6bd |
15 | 6b359768 |
hex | 44b9a267 |
1153016423 has 8 divisors (see below), whose sum is σ = 1284528000. Its totient is φ = 1027621728.
The previous prime is 1153016413. The next prime is 1153016453. The reversal of 1153016423 is 3246103511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1153016423 - 28 = 1153016167 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1153016392 and 1153016401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1153016413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1528823 + ... + 1529576.
It is an arithmetic number, because the mean of its divisors is an integer number (160566000).
Almost surely, 21153016423 is an apocalyptic number.
1153016423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1153016423 is a deficient number, since it is larger than the sum of its proper divisors (131511577).
1153016423 is a wasteful number, since it uses less digits than its factorization.
1153016423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3058441.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 1153016423 is about 33956.0955205395. The cubic root of 1153016423 is about 1048.6047751356.
Adding to 1153016423 its reverse (3246103511), we get a palindrome (4399119934).
The spelling of 1153016423 in words is "one billion, one hundred fifty-three million, sixteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •