Base | Representation |
---|---|
bin | 100010010111111… |
… | …1111010111101111 |
3 | 2222101101100220112 |
4 | 1010233333113233 |
5 | 4330234243043 |
6 | 310242010235 |
7 | 40404000443 |
oct | 10457772757 |
9 | 2871340815 |
10 | 1153431023 |
11 | 542099888 |
12 | 28234697b |
13 | 154c6a984 |
14 | ad28a823 |
15 | 6b3dc518 |
hex | 44bff5ef |
1153431023 has 4 divisors (see below), whose sum is σ = 1153601040. Its totient is φ = 1153261008.
The previous prime is 1153430951. The next prime is 1153431101. The reversal of 1153431023 is 3201343511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3201343511 = 157 ⋅20390723.
It is a cyclic number.
It is not a de Polignac number, because 1153431023 - 212 = 1153426927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1153431023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1153431823) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74390 + ... + 88547.
It is an arithmetic number, because the mean of its divisors is an integer number (288400260).
Almost surely, 21153431023 is an apocalyptic number.
1153431023 is a deficient number, since it is larger than the sum of its proper divisors (170017).
1153431023 is an equidigital number, since it uses as much as digits as its factorization.
1153431023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170016.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1153431023 is about 33962.1999140221. The cubic root of 1153431023 is about 1048.7304453436.
Adding to 1153431023 its reverse (3201343511), we get a palindrome (4354774534).
The spelling of 1153431023 in words is "one billion, one hundred fifty-three million, four hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •