Base | Representation |
---|---|
bin | 100001111110110… |
… | …0100100101101011 |
3 | 2221110111212201201 |
4 | 1003331210211223 |
5 | 4313343322443 |
6 | 305050425031 |
7 | 40153442266 |
oct | 10375444553 |
9 | 2843455651 |
10 | 1140214123 |
11 | 535691824 |
12 | 279a32177 |
13 | 1522c0b19 |
14 | ab609cdd |
15 | 6a17b34d |
hex | 43f6496b |
1140214123 has 4 divisors (see below), whose sum is σ = 1207285560. Its totient is φ = 1073142688.
The previous prime is 1140214099. The next prime is 1140214151. The reversal of 1140214123 is 3214120411.
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 1140214123 - 29 = 1140213611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1140214123.
It is not an unprimeable number, because it can be changed into a prime (1140214723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33535693 + ... + 33535726.
It is an arithmetic number, because the mean of its divisors is an integer number (301821390).
Almost surely, 21140214123 is an apocalyptic number.
1140214123 is a deficient number, since it is larger than the sum of its proper divisors (67071437).
1140214123 is an equidigital number, since it uses as much as digits as its factorization.
1140214123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67071436.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1140214123 is about 33767.0567713563. The cubic root of 1140214123 is about 1044.7093269067.
Adding to 1140214123 its reverse (3214120411), we get a palindrome (4354334534).
The spelling of 1140214123 in words is "one billion, one hundred forty million, two hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •