Base | Representation |
---|---|
bin | 10101000110111000111… |
… | …001110010101000110000 |
3 | 12010200000021012100022122 |
4 | 111012320321302220300 |
5 | 142231114032323422 |
6 | 3030204152253412 |
7 | 206536615504205 |
oct | 25067071625060 |
9 | 5120007170278 |
10 | 1450506136112 |
11 | 50a179998950 |
12 | 1b514b6a1268 |
13 | a6a22499907 |
14 | 502c224bcac |
15 | 27ae7180d42 |
hex | 151b8e72a30 |
1450506136112 has 80 divisors (see below), whose sum is σ = 3133548895392. Its totient is φ = 644839004160.
The previous prime is 1450506136099. The next prime is 1450506136127. The reversal of 1450506136112 is 2116316050541.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2711708 + ... + 3202244.
Almost surely, 21450506136112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1450506136112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1566774447696).
1450506136112 is an abundant number, since it is smaller than the sum of its proper divisors (1683042759280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1450506136112 is a wasteful number, since it uses less digits than its factorization.
1450506136112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490926 (or 490920 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 1450506136112 in words is "one trillion, four hundred fifty billion, five hundred six million, one hundred thirty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •