Base | Representation |
---|---|
bin | 101110101010010010… |
… | …0011111100011111010 |
3 | 100120122022210220122010 |
4 | 1131110210133203322 |
5 | 3120203443203120 |
6 | 114011020110350 |
7 | 10145061204660 |
oct | 1352444374372 |
9 | 316568726563 |
10 | 100203100410 |
11 | 39550046486 |
12 | 175059953b6 |
13 | 95ab910cba |
14 | 4bc800cc30 |
15 | 2916ea77e0 |
hex | 175491f8fa |
100203100410 has 128 divisors (see below), whose sum is σ = 292794808320. Its totient is φ = 21436621056.
The previous prime is 100203100399. The next prime is 100203100427. The reversal of 100203100410 is 14001302001.
It is a happy number.
It is a super-2 number, since 2×1002031004102 (a number of 23 digits) contains 22 as substring.
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, 179884 + ... + 482456.
It is an arithmetic number, because the mean of its divisors is an integer number (2287459440).
Almost surely, 2100203100410 is an apocalyptic number.
100203100410 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 100203100410, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146397404160).
100203100410 is an abundant number, since it is smaller than the sum of its proper divisors (192591707910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100203100410 is a wasteful number, since it uses less digits than its factorization.
100203100410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302692.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 100203100410 its reverse (14001302001), we get a palindrome (114204402411).
The spelling of 100203100410 in words is "one hundred billion, two hundred three million, one hundred thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •