Base | Representation |
---|---|
bin | 100010010010010… |
… | …1000001001100011 |
3 | 2222011210000220022 |
4 | 1010210220021203 |
5 | 4324003433243 |
6 | 310054104055 |
7 | 40336453256 |
oct | 10444501143 |
9 | 2864700808 |
10 | 1150452323 |
11 | 540444949 |
12 | 28134b02b |
13 | 154466c27 |
14 | acb1309d |
15 | 6aeeeb68 |
hex | 44928263 |
1150452323 has 8 divisors (see below), whose sum is σ = 1175549760. Its totient is φ = 1125380800.
The previous prime is 1150452319. The next prime is 1150452343. The reversal of 1150452323 is 3232540511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1150452323 - 22 = 1150452319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1150452292 and 1150452301.
It is not an unprimeable number, because it can be changed into a prime (1150452343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103223 + ... + 113823.
It is an arithmetic number, because the mean of its divisors is an integer number (146943720).
Almost surely, 21150452323 is an apocalyptic number.
1150452323 is a deficient number, since it is larger than the sum of its proper divisors (25097437).
1150452323 is a wasteful number, since it uses less digits than its factorization.
1150452323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12957.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 1150452323 is about 33918.3183987650. The cubic root of 1150452323 is about 1047.8268957699.
Adding to 1150452323 its reverse (3232540511), we get a palindrome (4382992834).
The spelling of 1150452323 in words is "one billion, one hundred fifty million, four hundred fifty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •