Base | Representation |
---|---|
bin | 11111111000010111111010… |
… | …000010011001101000110111 |
3 | 200101110021022002100011210202 |
4 | 133320113322002121220313 |
5 | 121334224021442424343 |
6 | 1214113051531111115 |
7 | 41351040551016533 |
oct | 3770277202315067 |
9 | 611407262304722 |
10 | 140213402311223 |
11 | 4074919628120a |
12 | 138863688a249b |
13 | 60310b4571b37 |
14 | 268a517340bc3 |
15 | 1132414380db8 |
hex | 7f85fa099a37 |
140213402311223 has 4 divisors (see below), whose sum is σ = 140216599705368. Its totient is φ = 140210204917080.
The previous prime is 140213402311153. The next prime is 140213402311267. The reversal of 140213402311223 is 322113204312041.
It is a happy number.
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 140213402311223 - 210 = 140213402310199 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140213404311223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1598631293 + ... + 1598718998.
It is an arithmetic number, because the mean of its divisors is an integer number (35054149926342).
Almost surely, 2140213402311223 is an apocalyptic number.
140213402311223 is a deficient number, since it is larger than the sum of its proper divisors (3197394145).
140213402311223 is an equidigital number, since it uses as much as digits as its factorization.
140213402311223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3197394144.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 140213402311223 its reverse (322113204312041), we get a palindrome (462326606623264).
The spelling of 140213402311223 in words is "one hundred forty trillion, two hundred thirteen billion, four hundred two million, three hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •