Base | Representation |
---|---|
bin | 100001111110101… |
… | …1000001011111011 |
3 | 2221110102022001020 |
4 | 1003331120023323 |
5 | 4313340211243 |
6 | 305045353523 |
7 | 40153141215 |
oct | 10375301373 |
9 | 2843368036 |
10 | 1140163323 |
11 | 535657642 |
12 | 279a088a3 |
13 | 1522a3970 |
14 | ab5d55b5 |
15 | 6a16b283 |
hex | 43f582fb |
1140163323 has 16 divisors (see below), whose sum is σ = 1637771520. Its totient is φ = 701375904.
The previous prime is 1140163319. The next prime is 1140163373. The reversal of 1140163323 is 3233610411.
It is a happy number.
It is not a de Polignac number, because 1140163323 - 22 = 1140163319 is a prime.
It is a super-2 number, since 2×11401633232 = 2599944806228804658, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140163293 and 1140163302.
It is not an unprimeable number, because it can be changed into a prime (1140163373) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175548 + ... + 181926.
It is an arithmetic number, because the mean of its divisors is an integer number (102360720).
Almost surely, 21140163323 is an apocalyptic number.
1140163323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1140163323 is a deficient number, since it is larger than the sum of its proper divisors (497608197).
1140163323 is a wasteful number, since it uses less digits than its factorization.
1140163323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10978.
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 1140163323 is about 33766.3045505427. The cubic root of 1140163323 is about 1044.6938116858.
Adding to 1140163323 its reverse (3233610411), we get a palindrome (4373773734).
The spelling of 1140163323 in words is "one billion, one hundred forty million, one hundred sixty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •