Base | Representation |
---|---|
bin | 10010111010000110… |
… | …11011001100110000 |
3 | 222012110002222220102 |
4 | 21131003123030300 |
5 | 131242141113040 |
6 | 4355141331532 |
7 | 506361020102 |
oct | 113503331460 |
9 | 28173088812 |
10 | 10151113520 |
11 | 433a047919 |
12 | 1b73706ba8 |
13 | c5a0b9162 |
14 | 6c425b572 |
15 | 3e62ac515 |
hex | 25d0db330 |
10151113520 has 20 divisors (see below), whose sum is σ = 23601339120. Its totient is φ = 4060445376.
The previous prime is 10151113507. The next prime is 10151113591. The reversal of 10151113520 is 2531115101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (20).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10151113492 and 10151113501.
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, 63444380 + ... + 63444539.
It is an arithmetic number, because the mean of its divisors is an integer number (1180066956).
Almost surely, 210151113520 is an apocalyptic number.
10151113520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10151113520 is an abundant number, since it is smaller than the sum of its proper divisors (13450225600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151113520 is a wasteful number, since it uses less digits than its factorization.
10151113520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126888932 (or 126888926 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 10151113520 its reverse (2531115101), we get a palindrome (12682228621).
The spelling of 10151113520 in words is "ten billion, one hundred fifty-one million, one hundred thirteen thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •