Base | Representation |
---|---|
bin | 11111110101101110000010… |
… | …010001010111000011010000 |
3 | 200100210211111110101020001002 |
4 | 133311232002101113003100 |
5 | 121323231444102343212 |
6 | 1213453204425401132 |
7 | 41331622553604122 |
oct | 3765560221270320 |
9 | 610724443336032 |
10 | 140031004340432 |
11 | 406888a7393097 |
12 | 13856b440391a8 |
13 | 6019b36ba247a |
14 | 2681772c93212 |
15 | 112c7db3a2ac2 |
hex | 7f5b824570d0 |
140031004340432 has 20 divisors (see below), whose sum is σ = 280062008681856. Its totient is φ = 67756937583840.
The previous prime is 140031004340419. The next prime is 140031004340467. The reversal of 140031004340432 is 234043400130041.
It is a happy number.
140031004340432 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 140031004340395 and 140031004340404.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141160286138 + ... + 141160287129.
Almost surely, 2140031004340432 is an apocalyptic number.
It is an amenable number.
140031004340432 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140031004340432 is a wasteful number, since it uses less digits than its factorization.
140031004340432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282320573306 (or 282320573300 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 140031004340432 its reverse (234043400130041), we get a palindrome (374074404470473).
The spelling of 140031004340432 in words is "one hundred forty trillion, thirty-one billion, four million, three hundred forty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •