Base | Representation |
---|---|
bin | 10101000111000001000… |
… | …110001101110111111100 |
3 | 12010200100211212210121001 |
4 | 111013001012031313330 |
5 | 142231404231024012 |
6 | 3030225543020044 |
7 | 206543205150052 |
oct | 25070106156774 |
9 | 5120324783531 |
10 | 1450643611132 |
11 | 50a23a555971 |
12 | 1b518973a624 |
13 | a6a44b01891 |
14 | 502d65d61d2 |
15 | 27b04289357 |
hex | 151c118ddfc |
1450643611132 has 12 divisors (see below), whose sum is σ = 2555438415376. Its totient is φ = 720518349600.
The previous prime is 1450643611099. The next prime is 1450643611163. The reversal of 1450643611132 is 2311163460541.
It is a junction number, because it is equal to n+sod(n) for n = 1450643611091 and 1450643611100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1200863313 + ... + 1200864520.
Almost surely, 21450643611132 is an apocalyptic number.
It is an amenable number.
1450643611132 is a deficient number, since it is larger than the sum of its proper divisors (1104794804244).
1450643611132 is a wasteful number, since it uses less digits than its factorization.
1450643611132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2401727988 (or 2401727986 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 1450643611132 in words is "one trillion, four hundred fifty billion, six hundred forty-three million, six hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •