Base | Representation |
---|---|
bin | 1000001011111110000… |
… | …1100101010110001011 |
3 | 111110001021221100102122 |
4 | 2002333201211112023 |
5 | 4301023431033301 |
6 | 144340440521455 |
7 | 13106331006632 |
oct | 2027741452613 |
9 | 443037840378 |
10 | 140652205451 |
11 | 5471755980a |
12 | 2331418028b |
13 | 10356a38a94 |
14 | 6b440c4519 |
15 | 39d310281b |
hex | 20bf86558b |
140652205451 has 8 divisors (see below), whose sum is σ = 143561853360. Its totient is φ = 137772097408.
The previous prime is 140652205433. The next prime is 140652205457. The reversal of 140652205451 is 154502256041.
140652205451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140652205451 - 218 = 140651943307 is a prime.
It is a super-2 number, since 2×1406522054512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140652205457) 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 7 ways as a sum of consecutive naturals, for example, 7375346 + ... + 7394391.
It is an arithmetic number, because the mean of its divisors is an integer number (17945231670).
Almost surely, 2140652205451 is an apocalyptic number.
140652205451 is a deficient number, since it is larger than the sum of its proper divisors (2909647909).
140652205451 is a wasteful number, since it uses less digits than its factorization.
140652205451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14769933.
The product of its (nonzero) digits is 48000, while the sum is 35.
The spelling of 140652205451 in words is "one hundred forty billion, six hundred fifty-two million, two hundred five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •