Base | Representation |
---|---|
bin | 1000110100000010111… |
… | …1100000000000001101 |
3 | 112110211000201102111222 |
4 | 2031000233200000031 |
5 | 4440041433032122 |
6 | 153320134453125 |
7 | 13640040116252 |
oct | 2150057400015 |
9 | 473730642458 |
10 | 151410049037 |
11 | 59238030935 |
12 | 25416b041a5 |
13 | 1137c738bc0 |
14 | 7484b5b429 |
15 | 3e127abb42 |
hex | 2340be000d |
151410049037 has 16 divisors (see below), whose sum is σ = 163908904320. Its totient is φ = 139034280000.
The previous prime is 151410049027. The next prime is 151410049067. The reversal of 151410049037 is 730940014151.
It is a cyclic number.
It is not a de Polignac number, because 151410049037 - 28 = 151410048781 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151410048988 and 151410049006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151410049027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2650664 + ... + 2707182.
It is an arithmetic number, because the mean of its divisors is an integer number (10244306520).
Almost surely, 2151410049037 is an apocalyptic number.
It is an amenable number.
151410049037 is a deficient number, since it is larger than the sum of its proper divisors (12498855283).
151410049037 is a wasteful number, since it uses less digits than its factorization.
151410049037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57604.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 151410049037 in words is "one hundred fifty-one billion, four hundred ten million, forty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •