Base | Representation |
---|---|
bin | 10010110100010001… |
… | …11101000000111100 |
3 | 222002001010111211102 |
4 | 21122020331000330 |
5 | 131142132343400 |
6 | 4350233512232 |
7 | 505225355543 |
oct | 113210750074 |
9 | 28061114742 |
10 | 10102231100 |
11 | 431449a825 |
12 | 1b5b272678 |
13 | c4cc32650 |
14 | 6bb97515a |
15 | 3e1d539d5 |
hex | 25a23d03c |
10102231100 has 72 divisors (see below), whose sum is σ = 23627862720. Its totient is φ = 3726938880.
The previous prime is 10102231093. The next prime is 10102231109. The reversal of 10102231100 is 113220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102231109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2055446 + ... + 2060354.
It is an arithmetic number, because the mean of its divisors is an integer number (328164760).
Almost surely, 210102231100 is an apocalyptic number.
10102231100 is a gapful number since it is divisible by the number (10) 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 10102231100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11813931360).
10102231100 is an abundant number, since it is smaller than the sum of its proper divisors (13525631620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102231100 is a wasteful number, since it uses less digits than its factorization.
10102231100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6519 (or 6512 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10102231100 its reverse (113220101), we get a palindrome (10215451201).
The spelling of 10102231100 in words is "ten billion, one hundred two million, two hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •