Base | Representation |
---|---|
bin | 100010010001111… |
… | …1010101010100111 |
3 | 2222011102120100022 |
4 | 1010203322222213 |
5 | 4323432003043 |
6 | 310050105355 |
7 | 40335046154 |
oct | 10443725247 |
9 | 2864376308 |
10 | 1150266023 |
11 | 540327985 |
12 | 28127b25b |
13 | 1544001aa |
14 | acaa522b |
15 | 6aeb4868 |
hex | 448faaa7 |
1150266023 has 4 divisors (see below), whose sum is σ = 1210806360. Its totient is φ = 1089725688.
The previous prime is 1150266017. The next prime is 1150266031. The reversal of 1150266023 is 3206620511.
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 1150266023 - 212 = 1150261927 is a prime.
It is a super-2 number, since 2×11502660232 = 2646223847336473058, 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 = 1150265983 and 1150266001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150266043) 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, 30270140 + ... + 30270177.
It is an arithmetic number, because the mean of its divisors is an integer number (302701590).
Almost surely, 21150266023 is an apocalyptic number.
1150266023 is a deficient number, since it is larger than the sum of its proper divisors (60540337).
1150266023 is an equidigital number, since it uses as much as digits as its factorization.
1150266023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60540336.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 1150266023 is about 33915.5719839722. The cubic root of 1150266023 is about 1047.7703323108.
Adding to 1150266023 its reverse (3206620511), we get a palindrome (4356886534).
The spelling of 1150266023 in words is "one billion, one hundred fifty million, two hundred sixty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •