Base | Representation |
---|---|
bin | 100010010001111… |
… | …0010101101010111 |
3 | 2222011100220122012 |
4 | 1010203302231113 |
5 | 4323424432211 |
6 | 310045254435 |
7 | 40334552144 |
oct | 10443625527 |
9 | 2864326565 |
10 | 1150233431 |
11 | 540305446 |
12 | 28126441b |
13 | 1543bb3c9 |
14 | aca973cb |
15 | 6aea9d8b |
hex | 448f2b57 |
1150233431 has 4 divisors (see below), whose sum is σ = 1150429512. Its totient is φ = 1150037352.
The previous prime is 1150233391. The next prime is 1150233433. The reversal of 1150233431 is 1343320511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1150233431 - 210 = 1150232407 is a prime.
It is a super-2 number, since 2×11502334312 = 2646073891580063522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1150233397 and 1150233406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150233433) 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, 88961 + ... + 101066.
It is an arithmetic number, because the mean of its divisors is an integer number (287607378).
Almost surely, 21150233431 is an apocalyptic number.
1150233431 is a deficient number, since it is larger than the sum of its proper divisors (196081).
1150233431 is an equidigital number, since it uses as much as digits as its factorization.
1150233431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196080.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1150233431 is about 33915.0914933161. The cubic root of 1150233431 is about 1047.7604362657.
Adding to 1150233431 its reverse (1343320511), we get a palindrome (2493553942).
The spelling of 1150233431 in words is "one billion, one hundred fifty million, two hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •