Base | Representation |
---|---|
bin | 11100000010110010… |
… | …00010001010110000 |
3 | 1102212021000002100001 |
4 | 32001121002022300 |
5 | 221313231201412 |
6 | 10525544235344 |
7 | 1042044360442 |
oct | 160131021260 |
9 | 42767002301 |
10 | 15055725232 |
11 | 6426623229 |
12 | 2b0216bb54 |
13 | 155c25a372 |
14 | a2b7ac492 |
15 | 5d1b70957 |
hex | 3816422b0 |
15055725232 has 20 divisors (see below), whose sum is σ = 30886378056. Its totient is φ = 7085047040.
The previous prime is 15055725193. The next prime is 15055725247. The reversal of 15055725232 is 23252755051.
It is a super-2 number, since 2×150557252322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15055725191 and 15055725200.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27675694 + ... + 27676237.
Almost surely, 215055725232 is an apocalyptic number.
It is an amenable number.
15055725232 is an abundant number, since it is smaller than the sum of its proper divisors (15830652824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15055725232 is a wasteful number, since it uses less digits than its factorization.
15055725232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55351956 (or 55351950 counting only the distinct ones).
The product of its (nonzero) digits is 105000, while the sum is 37.
The spelling of 15055725232 in words is "fifteen billion, fifty-five million, seven hundred twenty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •