Base | Representation |
---|---|
bin | 11111111100000011110111… |
… | …110001101010101100101001 |
3 | 200102100111021112112022201101 |
4 | 133330003313301222230221 |
5 | 121402401414431100211 |
6 | 1214425313033121401 |
7 | 41405250305051413 |
oct | 3774036761525451 |
9 | 612314245468641 |
10 | 140466767440681 |
11 | 40836692293a90 |
12 | 13907498259261 |
13 | 604bc61867996 |
14 | 26988b0a439b3 |
15 | 1138ce28155c1 |
hex | 7fc0f7c6ab29 |
140466767440681 has 16 divisors (see below), whose sum is σ = 155886453227520. Its totient is φ = 125507539115280.
The previous prime is 140466767440667. The next prime is 140466767440697. The reversal of 140466767440681 is 186044767664041.
It is a cyclic number.
It is not a de Polignac number, because 140466767440681 - 29 = 140466767440169 is a prime.
It is a super-2 number, since 2×1404667674406812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140466767440651) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 469705041 + ... + 470003998.
It is an arithmetic number, because the mean of its divisors is an integer number (9742903326720).
Almost surely, 2140466767440681 is an apocalyptic number.
140466767440681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140466767440681 is a deficient number, since it is larger than the sum of its proper divisors (15419685786839).
140466767440681 is a wasteful number, since it uses less digits than its factorization.
140466767440681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 939709284.
The product of its (nonzero) digits is 130056192, while the sum is 64.
The spelling of 140466767440681 in words is "one hundred forty trillion, four hundred sixty-six billion, seven hundred sixty-seven million, four hundred forty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •