Base | Representation |
---|---|
bin | 1000001011000100011… |
… | …0011111001100001011 |
3 | 111102102102121021121112 |
4 | 2002301012133030023 |
5 | 4300030004040243 |
6 | 144300434200535 |
7 | 13100332121561 |
oct | 2026106371413 |
9 | 442372537545 |
10 | 140410221323 |
11 | 54602a00529 |
12 | 2326712314b |
13 | 10318871ac8 |
14 | 6b1dcd3a31 |
15 | 39bbc53818 |
hex | 20b119f30b |
140410221323 has 4 divisors (see below), whose sum is σ = 140449877568. Its totient is φ = 140370565080.
The previous prime is 140410221283. The next prime is 140410221361. The reversal of 140410221323 is 323122014041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323122014041 = 32257 ⋅10017113.
It is a cyclic number.
It is not a de Polignac number, because 140410221323 - 210 = 140410220299 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140410221023) 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, 19822811 + ... + 19829892.
It is an arithmetic number, because the mean of its divisors is an integer number (35112469392).
Almost surely, 2140410221323 is an apocalyptic number.
140410221323 is a deficient number, since it is larger than the sum of its proper divisors (39656245).
140410221323 is an equidigital number, since it uses as much as digits as its factorization.
140410221323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39656244.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 140410221323 its reverse (323122014041), we get a palindrome (463532235364).
The spelling of 140410221323 in words is "one hundred forty billion, four hundred ten million, two hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •