Base | Representation |
---|---|
bin | 1000110010101000110… |
… | …0001010110000000000 |
3 | 112102211122202201000100 |
4 | 2030222030022300000 |
5 | 4433303103010232 |
6 | 153214421122400 |
7 | 13624464111360 |
oct | 2145214126000 |
9 | 472748681010 |
10 | 151031688192 |
11 | 590634a5820 |
12 | 25330259400 |
13 | 1131c232b48 |
14 | 744a7ca9a0 |
15 | 3dde46ec7c |
hex | 232a30ac00 |
151031688192 has 1056 divisors, whose sum is σ = 579395980800. Its totient is φ = 36746035200.
The previous prime is 151031688187. The next prime is 151031688263. The reversal of 151031688192 is 291886130151.
151031688192 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (1056).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 843752359 + ... + 843752537.
Almost surely, 2151031688192 is an apocalyptic number.
151031688192 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 151031688192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (289697990400).
151031688192 is an abundant number, since it is smaller than the sum of its proper divisors (428364292608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151031688192 is a wasteful number, since it uses less digits than its factorization.
151031688192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293 (or 272 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 45.
The spelling of 151031688192 in words is "one hundred fifty-one billion, thirty-one million, six hundred eighty-eight thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •