Base | Representation |
---|---|
bin | 1000001011000010101… |
… | …1110011001101011000 |
3 | 111102101221102212001110 |
4 | 2002300223303031120 |
5 | 4300021211203212 |
6 | 144300024220320 |
7 | 13100215503441 |
oct | 2026053631530 |
9 | 442357385043 |
10 | 140403225432 |
11 | 545a9a623a8 |
12 | 2326490a6a0 |
13 | 10317292722 |
14 | 6b1cdd22c8 |
15 | 39bb320a3c |
hex | 20b0af3358 |
140403225432 has 32 divisors (see below), whose sum is σ = 351022074480. Its totient is φ = 46799207040.
The previous prime is 140403225397. The next prime is 140403225461. The reversal of 140403225432 is 234522304041.
It is a super-3 number, since 3×1404032254323 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140403225432.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582498 + ... + 787470.
Almost surely, 2140403225432 is an apocalyptic number.
140403225432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140403225432 is an abundant number, since it is smaller than the sum of its proper divisors (210618849048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140403225432 is a wasteful number, since it uses less digits than its factorization.
140403225432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233523 (or 233519 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 140403225432 its reverse (234522304041), we get a palindrome (374925529473).
The spelling of 140403225432 in words is "one hundred forty billion, four hundred three million, two hundred twenty-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •