Base | Representation |
---|---|
bin | 1000001010010001000… |
… | …0000101000110000110 |
3 | 111101212101221012202101 |
4 | 2002210100011012012 |
5 | 4244104311211240 |
6 | 144223213302314 |
7 | 13062103465513 |
oct | 2024420050606 |
9 | 441771835671 |
10 | 140194632070 |
11 | 54502240099 |
12 | 23206a9499a |
13 | 102b2cb9bbc |
14 | 6add41430a |
15 | 39a7d6a39a |
hex | 20a4405186 |
140194632070 has 32 divisors (see below), whose sum is σ = 265491880416. Its totient is φ = 53231443200.
The previous prime is 140194632049. The next prime is 140194632103. The reversal of 140194632070 is 70236491041.
It is a super-2 number, since 2×1401946320702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4605616 + ... + 4635955.
It is an arithmetic number, because the mean of its divisors is an integer number (8296621263).
Almost surely, 2140194632070 is an apocalyptic number.
140194632070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140194632070 is a deficient number, since it is larger than the sum of its proper divisors (125297248346).
140194632070 is a wasteful number, since it uses less digits than its factorization.
140194632070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9241656.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 140194632070 in words is "one hundred forty billion, one hundred ninety-four million, six hundred thirty-two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •