Base | Representation |
---|---|
bin | 10110110010010000000010… |
… | …001110001001101001000010 |
3 | 111010211000002010110001120010 |
4 | 112302100002032021221002 |
5 | 101113321004314323320 |
6 | 553043534210525350 |
7 | 30051643345366362 |
oct | 2662200216115102 |
9 | 433730063401503 |
10 | 100210214214210 |
11 | 29a25a054a3721 |
12 | b2a54b1b96856 |
13 | 43bba23645649 |
14 | 1aa62b36989a2 |
15 | b8ba6e817ae0 |
hex | 5b2402389a42 |
100210214214210 has 128 divisors (see below), whose sum is σ = 242807838347520. Its totient is φ = 26468402688000.
The previous prime is 100210214214199. The next prime is 100210214214211. The reversal of 100210214214210 is 12412412012001.
It is not an unprimeable number, because it can be changed into a prime (100210214214211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 975695860 + ... + 975798560.
It is an arithmetic number, because the mean of its divisors is an integer number (1896936237090).
Almost surely, 2100210214214210 is an apocalyptic number.
100210214214210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100210214214210 is an abundant number, since it is smaller than the sum of its proper divisors (142597624133310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100210214214210 is a wasteful number, since it uses less digits than its factorization.
100210214214210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103684.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 100210214214210 its reverse (12412412012001), we get a palindrome (112622626226211).
The spelling of 100210214214210 in words is "one hundred trillion, two hundred ten billion, two hundred fourteen million, two hundred fourteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •