Base | Representation |
---|---|
bin | 10010101110110001… |
… | …01001110100101110 |
3 | 221221211011111110120 |
4 | 21113120221310232 |
5 | 131043314441100 |
6 | 4341503145410 |
7 | 504124501266 |
oct | 112730516456 |
9 | 27854144416 |
10 | 10056015150 |
11 | 42a03a4025 |
12 | 1b478a5266 |
13 | c434a072c |
14 | 6b57847a6 |
15 | 3dcc750a0 |
hex | 257629d2e |
10056015150 has 96 divisors (see below), whose sum is σ = 26267390208. Its totient is φ = 2540947200.
The previous prime is 10056015139. The next prime is 10056015163. The reversal of 10056015150 is 5151065001.
It is a super-2 number, since 2×100560151502 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10056015150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 355530 + ... + 382770.
It is an arithmetic number, because the mean of its divisors is an integer number (273618648).
Almost surely, 210056015150 is an apocalyptic number.
10056015150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10056015150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13133695104).
10056015150 is an abundant number, since it is smaller than the sum of its proper divisors (16211375058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10056015150 is a wasteful number, since it uses less digits than its factorization.
10056015150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27386 (or 27381 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 10056015150 in words is "ten billion, fifty-six million, fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •