Base | Representation |
---|---|
bin | 11111111001010001111001… |
… | …000101110110101001101110 |
3 | 200101200020000011200111111202 |
4 | 133321101321011312221232 |
5 | 121341234024321340240 |
6 | 1214201430011445502 |
7 | 41355403465054520 |
oct | 3771217105665156 |
9 | 611606004614452 |
10 | 140275663465070 |
11 | 40772636057661 |
12 | 13896443a56892 |
13 | 6036c275c2883 |
14 | 268d54222da10 |
15 | 1133d5a380315 |
hex | 7f9479176a6e |
140275663465070 has 16 divisors (see below), whose sum is σ = 288567079128288. Its totient is φ = 48094513188000.
The previous prime is 140275663465043. The next prime is 140275663465073. The reversal of 140275663465070 is 70564366572041.
It is a happy number.
It is a super-2 number, since 2×1402756634650702 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140275663464997 and 140275663465015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140275663465073) 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, 1001969024681 + ... + 1001969024820.
It is an arithmetic number, because the mean of its divisors is an integer number (18035442445518).
Almost surely, 2140275663465070 is an apocalyptic number.
140275663465070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140275663465070 is an abundant number, since it is smaller than the sum of its proper divisors (148291415663218).
140275663465070 is a wasteful number, since it uses less digits than its factorization.
140275663465070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2003938049515.
The product of its (nonzero) digits is 25401600, while the sum is 56.
The spelling of 140275663465070 in words is "one hundred forty trillion, two hundred seventy-five billion, six hundred sixty-three million, four hundred sixty-five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •