Base | Representation |
---|---|
bin | 100010010001101… |
… | …1111001000001110 |
3 | 2222011012211121210 |
4 | 1010203133020032 |
5 | 4323414400410 |
6 | 310043435250 |
7 | 40334066262 |
oct | 10443371016 |
9 | 2864184553 |
10 | 1150153230 |
11 | 540260166 |
12 | 281225b26 |
13 | 154390a55 |
14 | aca760a2 |
15 | 6ae91220 |
hex | 448df20e |
1150153230 has 32 divisors (see below), whose sum is σ = 2791389600. Its totient is φ = 303260672.
The previous prime is 1150153189. The next prime is 1150153237. The reversal of 1150153230 is 323510511.
It is a super-4 number, since 4×11501532304 (a number of 37 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1150153197 and 1150153206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150153237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 212715 + ... + 218054.
It is an arithmetic number, because the mean of its divisors is an integer number (87230925).
Almost surely, 21150153230 is an apocalyptic number.
1150153230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1150153230 is an abundant number, since it is smaller than the sum of its proper divisors (1641236370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150153230 is a wasteful number, since it uses less digits than its factorization.
1150153230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 430868.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 1150153230 is about 33913.9090934678. The cubic root of 1150153230 is about 1047.7360837051.
Adding to 1150153230 its reverse (323510511), we get a palindrome (1473663741).
The spelling of 1150153230 in words is "one billion, one hundred fifty million, one hundred fifty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •