Base | Representation |
---|---|
bin | 1000110010100011101… |
… | …0010100011011001100 |
3 | 112102210011101121200000 |
4 | 2030220322110123030 |
5 | 4433232104411022 |
6 | 153212333204300 |
7 | 13624113536043 |
oct | 2145072243314 |
9 | 472704347600 |
10 | 151010232012 |
11 | 59052380442 |
12 | 25325030690 |
13 | 1131795c993 |
14 | 7447a0355a |
15 | 3ddc6326ac |
hex | 2328e946cc |
151010232012 has 216 divisors, whose sum is σ = 422024842512. Its totient is φ = 47204208000.
The previous prime is 151010232007. The next prime is 151010232071. The reversal of 151010232012 is 210232010151.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 35437962 + ... + 35442222.
Almost surely, 2151010232012 is an apocalyptic number.
151010232012 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 151010232012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211012421256).
151010232012 is an abundant number, since it is smaller than the sum of its proper divisors (271014610500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151010232012 is a wasteful number, since it uses less digits than its factorization.
151010232012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4419 (or 4386 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 151010232012 its reverse (210232010151), we get a palindrome (361242242163).
The spelling of 151010232012 in words is "one hundred fifty-one billion, ten million, two hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •