Base | Representation |
---|---|
bin | 10010110100010001… |
… | …11000001000100000 |
3 | 222002001002111101211 |
4 | 21122020320020200 |
5 | 131142131223404 |
6 | 4350233235504 |
7 | 505225243336 |
oct | 113210701040 |
9 | 28061074354 |
10 | 10102211104 |
11 | 43144867a7 |
12 | 1b5b262b94 |
13 | c4cc2650b |
14 | 6bb96bb56 |
15 | 3e1d4cb04 |
hex | 25a238220 |
10102211104 has 48 divisors (see below), whose sum is σ = 21080211768. Its totient is φ = 4749115392.
The previous prime is 10102211081. The next prime is 10102211107. The reversal of 10102211104 is 40111220101.
It can be written as a sum of positive squares in 4 ways, for example, as 10069721104 + 32490000 = 100348^2 + 5700^2 .
It is not an unprimeable number, because it can be changed into a prime (10102211107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 552964 + ... + 570940.
Almost surely, 210102211104 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 10102211104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10540105884).
10102211104 is an abundant number, since it is smaller than the sum of its proper divisors (10978000664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102211104 is a wasteful number, since it uses less digits than its factorization.
10102211104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19037 (or 19029 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10102211104 its reverse (40111220101), we get a palindrome (50213431205).
The spelling of 10102211104 in words is "ten billion, one hundred two million, two hundred eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •