Base | Representation |
---|---|
bin | 10010111010000110… |
… | …01110001000000000 |
3 | 222012110000021110000 |
4 | 21131003032020000 |
5 | 131242132404333 |
6 | 4355140240000 |
7 | 506360405010 |
oct | 113503161000 |
9 | 28173007400 |
10 | 10151059968 |
11 | 433a010665 |
12 | 1b736a0000 |
13 | c5a09a97a |
14 | 6c4245c40 |
15 | 3e629b713 |
hex | 25d0ce200 |
10151059968 has 400 divisors, whose sum is σ = 35174177280. Its totient is φ = 2854600704.
The previous prime is 10151059951. The next prime is 10151059969. The reversal of 10151059968 is 86995015101.
10151059968 is a `hidden beast` number, since 1 + 0 + 1 + 51 + 0 + 599 + 6 + 8 = 666.
It is a super-2 number, since 2×101510599682 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10151059969) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 21191953 + ... + 21192431.
Almost surely, 210151059968 is an apocalyptic number.
10151059968 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10151059968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17587088640).
10151059968 is an abundant number, since it is smaller than the sum of its proper divisors (25023117312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151059968 is an frugal number, since it uses more digits than its factorization.
10151059968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 589 (or 564 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 45.
The spelling of 10151059968 in words is "ten billion, one hundred fifty-one million, fifty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •