Base | Representation |
---|---|
bin | 11111110111000010111110… |
… | …000010001010110101100111 |
3 | 200101010112220010120000002002 |
4 | 133313002332002022311213 |
5 | 121331230232013220143 |
6 | 1214003130045035515 |
7 | 41341331526162452 |
oct | 3767027602126547 |
9 | 611115803500062 |
10 | 140122201304423 |
11 | 40713545726a18 |
12 | 13870755855b9b |
13 | 602560b995060 |
14 | 2685d44b30499 |
15 | 112ed7786a5b8 |
hex | 7f70be08ad67 |
140122201304423 has 24 divisors (see below), whose sum is σ = 154185864959280. Its totient is φ = 126586599909120.
The previous prime is 140122201304369. The next prime is 140122201304429. The reversal of 140122201304423 is 324403102221041.
It is not a de Polignac number, because 140122201304423 - 232 = 140117906337127 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 (140122201304429) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 866052548 + ... + 866214326.
It is an arithmetic number, because the mean of its divisors is an integer number (6424411039970).
Almost surely, 2140122201304423 is an apocalyptic number.
140122201304423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140122201304423 is a deficient number, since it is larger than the sum of its proper divisors (14063663654857).
140122201304423 is a wasteful number, since it uses less digits than its factorization.
140122201304423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192047 (or 192000 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 140122201304423 its reverse (324403102221041), we get a palindrome (464525303525464).
The spelling of 140122201304423 in words is "one hundred forty trillion, one hundred twenty-two billion, two hundred one million, three hundred four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •