Base | Representation |
---|---|
bin | 100010010111111… |
… | …1111001011011000 |
3 | 2222101101022211020 |
4 | 1010233333023120 |
5 | 4330234231412 |
6 | 310242002440 |
7 | 40403665233 |
oct | 10457771330 |
9 | 2871338736 |
10 | 1153430232 |
11 | 542099229 |
12 | 282346420 |
13 | 154c6a4c6 |
14 | ad28a41a |
15 | 6b3dc18c |
hex | 44bff2d8 |
1153430232 has 16 divisors (see below), whose sum is σ = 2883575640. Its totient is φ = 384476736.
The previous prime is 1153430231. The next prime is 1153430249. The reversal of 1153430232 is 2320343511.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 48059593 = 1153430232 / (1 + 1 + 5 + 3 + 4 + 3 + 0 + 2 + 3 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1153430231) 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, 24029773 + ... + 24029820.
Almost surely, 21153430232 is an apocalyptic number.
1153430232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1153430232 is an abundant number, since it is smaller than the sum of its proper divisors (1730145408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1153430232 is a wasteful number, since it uses less digits than its factorization.
1153430232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48059602 (or 48059598 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 1153430232 is about 33962.1882687203. The cubic root of 1153430232 is about 1048.7302056107.
Adding to 1153430232 its reverse (2320343511), we get a palindrome (3473773743).
The spelling of 1153430232 in words is "one billion, one hundred fifty-three million, four hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •