Base | Representation |
---|---|
bin | 1000110010101011000… |
… | …1010101101000111000 |
3 | 112102212100002202011120 |
4 | 2030222301111220320 |
5 | 4433313101311440 |
6 | 153215410025240 |
7 | 13624642663335 |
oct | 2145261255070 |
9 | 472770082146 |
10 | 151041432120 |
11 | 59068a50557 |
12 | 25333578220 |
13 | 11321264c97 |
14 | 744bc0598c |
15 | 3de0246dd0 |
hex | 232ac55a38 |
151041432120 has 32 divisors (see below), whose sum is σ = 453124296720. Its totient is φ = 40277715200.
The previous prime is 151041432103. The next prime is 151041432131. The reversal of 151041432120 is 21234140151.
151041432120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 629339181 + ... + 629339420.
Almost surely, 2151041432120 is an apocalyptic number.
151041432120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
151041432120 is an abundant number, since it is smaller than the sum of its proper divisors (302082864600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151041432120 is a wasteful number, since it uses less digits than its factorization.
151041432120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1258678615 (or 1258678611 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 151041432120 its reverse (21234140151), we get a palindrome (172275572271).
The spelling of 151041432120 in words is "one hundred fifty-one billion, forty-one million, four hundred thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •