Base | Representation |
---|---|
bin | 100010010101111101001101… |
… | …011101010000100110011000 |
3 | 201210210111212120002201002102 |
4 | 202111331031131100212120 |
5 | 124244134331042223412 |
6 | 1253123532142422532 |
7 | 43546311556112645 |
oct | 4225751535204630 |
9 | 653714776081072 |
10 | 151042414414232 |
11 | 441438012a6360 |
12 | 14b35046b91a48 |
13 | 663831417b783 |
14 | 29426c5962dcc |
15 | 126de5e5ee8c2 |
hex | 895f4d750998 |
151042414414232 has 16 divisors (see below), whose sum is σ = 308950393120200. Its totient is φ = 68655642915520.
The previous prime is 151042414414169. The next prime is 151042414414261. The reversal of 151042414414232 is 232414414240151.
It is a happy number.
151042414414232 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 858195536357 + ... + 858195536532.
Almost surely, 2151042414414232 is an apocalyptic number.
It is an amenable number.
151042414414232 is an abundant number, since it is smaller than the sum of its proper divisors (157907978705968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151042414414232 is a wasteful number, since it uses less digits than its factorization.
151042414414232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1716391072906 (or 1716391072902 counting only the distinct ones).
The product of its (nonzero) digits is 122880, while the sum is 38.
Adding to 151042414414232 its reverse (232414414240151), we get a palindrome (383456828654383).
The spelling of 151042414414232 in words is "one hundred fifty-one trillion, forty-two billion, four hundred fourteen million, four hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •