Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11010101111111000 |
3 | 222001222101102111221 |
4 | 21122011122233320 |
5 | 131141413214222 |
6 | 4350202001424 |
7 | 505214445541 |
oct | 113205325770 |
9 | 28058342457 |
10 | 10101304312 |
11 | 4313a17490 |
12 | 1b5aaa6274 |
13 | c4c999858 |
14 | 6bb7b34c8 |
15 | 3e1c1e0c7 |
hex | 25a15abf8 |
10101304312 has 64 divisors (see below), whose sum is σ = 21882182400. Its totient is φ = 4326263040.
The previous prime is 10101304253. The next prime is 10101304319. The reversal of 10101304312 is 21340310101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101304319) 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, 98364 + ... + 172852.
It is an arithmetic number, because the mean of its divisors is an integer number (341909100).
Almost surely, 210101304312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10101304312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10941091200).
10101304312 is an abundant number, since it is smaller than the sum of its proper divisors (11780878088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101304312 is a wasteful number, since it uses less digits than its factorization.
10101304312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74596 (or 74592 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10101304312 its reverse (21340310101), we get a palindrome (31441614413).
It can be divided in two parts, 10101 and 304312, that added together give a palindrome (314413).
The spelling of 10101304312 in words is "ten billion, one hundred one million, three hundred four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •