Base | Representation |
---|---|
bin | 11111111000100001001110… |
… | …100011011110000110111101 |
3 | 200101111020010112221122200212 |
4 | 133320201032203132012331 |
5 | 121334410021002413041 |
6 | 1214121424555002205 |
7 | 41351543552462030 |
oct | 3770411643360675 |
9 | 611436115848625 |
10 | 140223410201021 |
11 | 40752461494a14 |
12 | 138882a0439365 |
13 | 603201aa92514 |
14 | 268abc6559017 |
15 | 11327ecc9b8eb |
hex | 7f884e8de1bd |
140223410201021 has 8 divisors (see below), whose sum is σ = 160261580991744. Its totient is φ = 120186803172240.
The previous prime is 140223410201011. The next prime is 140223410201033. The reversal of 140223410201021 is 120102014322041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140223410201021 - 210 = 140223410199997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140223410201011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 390748325 + ... + 391107018.
It is an arithmetic number, because the mean of its divisors is an integer number (20032697623968).
Almost surely, 2140223410201021 is an apocalyptic number.
It is an amenable number.
140223410201021 is a deficient number, since it is larger than the sum of its proper divisors (20038170790723).
140223410201021 is an equidigital number, since it uses as much as digits as its factorization.
140223410201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781880971.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 140223410201021 its reverse (120102014322041), we get a palindrome (260325424523062).
The spelling of 140223410201021 in words is "one hundred forty trillion, two hundred twenty-three billion, four hundred ten million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •