Base | Representation |
---|---|
bin | 1000110011100010000… |
… | …0110110001011010000 |
3 | 112110110101221022002010 |
4 | 2030320200312023100 |
5 | 4434301112134333 |
6 | 153254323422520 |
7 | 13633442461551 |
oct | 2147040661320 |
9 | 473411838063 |
10 | 151271989968 |
11 | 59177105030 |
12 | 25398824a40 |
13 | 11359c5b148 |
14 | 74706a0328 |
15 | 3e055da563 |
hex | 23388362d0 |
151271989968 has 320 divisors, whose sum is σ = 445255501824. Its totient is φ = 43862784000.
The previous prime is 151271989963. The next prime is 151271990041. The reversal of 151271989968 is 869989172151.
It is a Cunningham number, because it is equal to 3889372-1.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 151271989899 and 151271989908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151271989961) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 189801346 + ... + 189802142.
Almost surely, 2151271989968 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 151271989968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222627750912).
151271989968 is an abundant number, since it is smaller than the sum of its proper divisors (293983511856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151271989968 is a wasteful number, since it uses less digits than its factorization.
151271989968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034 (or 1028 counting only the distinct ones).
The product of its digits is 19595520, while the sum is 66.
The spelling of 151271989968 in words is "one hundred fifty-one billion, two hundred seventy-one million, nine hundred eighty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •