Base | Representation |
---|---|
bin | 11100001110000010… |
… | …01011110100111000 |
3 | 1110002211122200102120 |
4 | 32013001023310320 |
5 | 222011413333012 |
6 | 10543200001240 |
7 | 1044302015361 |
oct | 160701136470 |
9 | 43084580376 |
10 | 15150136632 |
11 | 6474947984 |
12 | 2b29900220 |
13 | 15759951b7 |
14 | a3a146b68 |
15 | 5da0be58c |
hex | 38704bd38 |
15150136632 has 32 divisors (see below), whose sum is σ = 37878366480. Its totient is φ = 5049642240.
The previous prime is 15150136613. The next prime is 15150136649. The reversal of 15150136632 is 23663105151.
It is a junction number, because it is equal to n+sod(n) for n = 15150136593 and 15150136602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 542532 + ... + 569772.
Almost surely, 215150136632 is an apocalyptic number.
15150136632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15150136632 is an abundant number, since it is smaller than the sum of its proper divisors (22728229848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15150136632 is a wasteful number, since it uses less digits than its factorization.
15150136632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50423 (or 50419 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 33.
The spelling of 15150136632 in words is "fifteen billion, one hundred fifty million, one hundred thirty-six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.383 sec. • engine limits •