Base | Representation |
---|---|
bin | 100001111110110… |
… | …1000010100101111 |
3 | 2221110112122201101 |
4 | 1003331220110233 |
5 | 4313344320143 |
6 | 305051023531 |
7 | 40153535014 |
oct | 10375502457 |
9 | 2843478641 |
10 | 1140229423 |
11 | 5356a2273 |
12 | 279a3aba7 |
13 | 1522c7a88 |
14 | ab61170b |
15 | 6a180b4d |
hex | 43f6852f |
1140229423 has 8 divisors (see below), whose sum is σ = 1210260960. Its totient is φ = 1070526720.
The previous prime is 1140229421. The next prime is 1140229427. The reversal of 1140229423 is 3249220411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1140229423 - 21 = 1140229421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140229391 and 1140229400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140229421) 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 7 ways as a sum of consecutive naturals, for example, 75043 + ... + 88948.
It is an arithmetic number, because the mean of its divisors is an integer number (151282620).
Almost surely, 21140229423 is an apocalyptic number.
1140229423 is a deficient number, since it is larger than the sum of its proper divisors (70031537).
1140229423 is a wasteful number, since it uses less digits than its factorization.
1140229423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164417.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 1140229423 is about 33767.2833227667. The cubic root of 1140229423 is about 1044.7139997077.
Adding to 1140229423 its reverse (3249220411), we get a palindrome (4389449834).
The spelling of 1140229423 in words is "one billion, one hundred forty million, two hundred twenty-nine thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •