Base | Representation |
---|---|
bin | 10010110101010111… |
… | …01010110011001100 |
3 | 222002200020212021110 |
4 | 21122223222303030 |
5 | 131202000102112 |
6 | 4351200532020 |
7 | 505365620451 |
oct | 113253526314 |
9 | 28080225243 |
10 | 10111331532 |
11 | 4319646045 |
12 | 1b62321010 |
13 | c51a9a913 |
14 | 6bcc63828 |
15 | 3e2a5013c |
hex | 25aaeaccc |
10111331532 has 48 divisors (see below), whose sum is σ = 24067169280. Its totient is φ = 3303233472.
The previous prime is 10111331509. The next prime is 10111331537. The reversal of 10111331532 is 23513311101.
It is a junction number, because it is equal to n+sod(n) for n = 10111331499 and 10111331508.
It is not an unprimeable number, because it can be changed into a prime (10111331537) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126469 + ... + 190307.
It is an arithmetic number, because the mean of its divisors is an integer number (501399360).
Almost surely, 210111331532 is an apocalyptic number.
10111331532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10111331532 is an abundant number, since it is smaller than the sum of its proper divisors (13955837748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111331532 is a wasteful number, since it uses less digits than its factorization.
10111331532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64110 (or 64108 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 10111331532 its reverse (23513311101), we get a palindrome (33624642633).
The spelling of 10111331532 in words is "ten billion, one hundred eleven million, three hundred thirty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •