Base | Representation |
---|---|
bin | 1000001001111101101… |
… | …0001101001000101111 |
3 | 111101122202002012210210 |
4 | 2002133122031020233 |
5 | 4243423012302432 |
6 | 144211152233503 |
7 | 13060066152423 |
oct | 2023732151057 |
9 | 441582065723 |
10 | 140113400367 |
11 | 544703a8556 |
12 | 231a383b893 |
13 | 1029c217cc5 |
14 | 6ad270ab83 |
15 | 39a0b718cc |
hex | 209f68d22f |
140113400367 has 32 divisors (see below), whose sum is σ = 198357811200. Its totient is φ = 87725459808.
The previous prime is 140113400363. The next prime is 140113400381. The reversal of 140113400367 is 763004311041.
140113400367 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140113400367 - 22 = 140113400363 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140113400363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9888634 + ... + 9902792.
It is an arithmetic number, because the mean of its divisors is an integer number (6198681600).
Almost surely, 2140113400367 is an apocalyptic number.
140113400367 is a deficient number, since it is larger than the sum of its proper divisors (58244410833).
140113400367 is a wasteful number, since it uses less digits than its factorization.
140113400367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15675.
The product of its (nonzero) digits is 6048, while the sum is 30.
The spelling of 140113400367 in words is "one hundred forty billion, one hundred thirteen million, four hundred thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •