Base | Representation |
---|---|
bin | 100001001101000… |
… | …0111100111111111 |
3 | 2212122110100012010 |
4 | 1002122013213333 |
5 | 4240210040411 |
6 | 302315542303 |
7 | 36416026665 |
oct | 10232074777 |
9 | 2778410163 |
10 | 1114143231 |
11 | 5219a5333 |
12 | 27115a993 |
13 | 149a93366 |
14 | a7d80c35 |
15 | 67c2b7a6 |
hex | 426879ff |
1114143231 has 8 divisors (see below), whose sum is σ = 1489933744. Its totient is φ = 740557440.
The previous prime is 1114143227. The next prime is 1114143269. The reversal of 1114143231 is 1323414111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1114143231 - 22 = 1114143227 is a prime.
It is a super-2 number, since 2×11141432312 = 2482630278366238722, 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 = 1114143198 and 1114143207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114143211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550000 + ... + 552021.
It is an arithmetic number, because the mean of its divisors is an integer number (186241718).
Almost surely, 21114143231 is an apocalyptic number.
1114143231 is a deficient number, since it is larger than the sum of its proper divisors (375790513).
1114143231 is a wasteful number, since it uses less digits than its factorization.
1114143231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1102361.
The product of its digits is 288, while the sum is 21.
The square root of 1114143231 is about 33378.7841450224. The cubic root of 1114143231 is about 1036.6854630826.
Adding to 1114143231 its reverse (1323414111), we get a palindrome (2437557342).
The spelling of 1114143231 in words is "one billion, one hundred fourteen million, one hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •