Base | Representation |
---|---|
bin | 1000110100101011001… |
… | …1001111011011111000 |
3 | 112111020210020221221110 |
4 | 2031022303033123320 |
5 | 4440413133130122 |
6 | 153345003440320 |
7 | 13644156362166 |
oct | 2151263173370 |
9 | 474223227843 |
10 | 151578801912 |
11 | 5931431141a |
12 | 254635260a0 |
13 | 113a86a2685 |
14 | 749d328236 |
15 | 3e224e290c |
hex | 234accf6f8 |
151578801912 has 128 divisors (see below), whose sum is σ = 400998173760. Its totient is φ = 47691141120.
The previous prime is 151578801911. The next prime is 151578801923. The reversal of 151578801912 is 219108875151.
It is a super-2 number, since 2×1515788019122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151578801911) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3935098 + ... + 3973430.
Almost surely, 2151578801912 is an apocalyptic number.
151578801912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 151578801912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200499086880).
151578801912 is an abundant number, since it is smaller than the sum of its proper divisors (249419371848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151578801912 is a wasteful number, since it uses less digits than its factorization.
151578801912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38513 (or 38509 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 48.
The spelling of 151578801912 in words is "one hundred fifty-one billion, five hundred seventy-eight million, eight hundred one thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •