Base | Representation |
---|---|
bin | 101110101101010000… |
… | …1111101110100011010 |
3 | 100120220021222110221110 |
4 | 1131122201331310122 |
5 | 3120410043214320 |
6 | 114024551321150 |
7 | 10150414202334 |
oct | 1353241756432 |
9 | 316807873843 |
10 | 100303101210 |
11 | 395a1538574 |
12 | 175333801b6 |
13 | 95c6554c80 |
14 | 4bd7400454 |
15 | 2920b5c5e0 |
hex | 175a87dd1a |
100303101210 has 128 divisors (see below), whose sum is σ = 281692938240. Its totient is φ = 22635936000.
The previous prime is 100303101203. The next prime is 100303101233. The reversal of 100303101210 is 12101303001.
It is a super-2 number, since 2×1003031012102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11385 + ... + 448035.
It is an arithmetic number, because the mean of its divisors is an integer number (2200726080).
Almost surely, 2100303101210 is an apocalyptic number.
100303101210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 100303101210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140846469120).
100303101210 is an abundant number, since it is smaller than the sum of its proper divisors (181389837030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100303101210 is a wasteful number, since it uses less digits than its factorization.
100303101210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436724.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 100303101210 its reverse (12101303001), we get a palindrome (112404404211).
The spelling of 100303101210 in words is "one hundred billion, three hundred three million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •