Base | Representation |
---|---|
bin | 1000001011010111100… |
… | …1000111100100001111 |
3 | 111102122000212002020001 |
4 | 2002311321013210033 |
5 | 4300211043242032 |
6 | 144312425105131 |
7 | 13102326264034 |
oct | 2026571074417 |
9 | 442560762201 |
10 | 140490602767 |
11 | 54644312279 |
12 | 2328a0281a7 |
13 | 1032c4069a8 |
14 | 6b2a85938b |
15 | 39c3d303e7 |
hex | 20b5e4790f |
140490602767 has 16 divisors (see below), whose sum is σ = 145478882304. Its totient is φ = 135596500000.
The previous prime is 140490602761. The next prime is 140490602783. The reversal of 140490602767 is 767206094041.
140490602767 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 140490602767 - 231 = 138343119119 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 (140490602761) 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 15 ways as a sum of consecutive naturals, for example, 1132542 + ... + 1250452.
It is an arithmetic number, because the mean of its divisors is an integer number (9092430144).
Almost surely, 2140490602767 is an apocalyptic number.
140490602767 is a deficient number, since it is larger than the sum of its proper divisors (4988279537).
140490602767 is a wasteful number, since it uses less digits than its factorization.
140490602767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118310.
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 140490602767 in words is "one hundred forty billion, four hundred ninety million, six hundred two thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •