Base | Representation |
---|---|
bin | 10110110010010001101100… |
… | …110110101101000111111011 |
3 | 111010211011200210210111010201 |
4 | 112302101230312231013323 |
5 | 101113333140311331303 |
6 | 553044431515423031 |
7 | 30052035600645424 |
oct | 2662215466550773 |
9 | 433734623714121 |
10 | 100212003230203 |
11 | 29a26743335937 |
12 | b2a5911154a77 |
13 | 43bbc4a18aca7 |
14 | 1aa640311264b |
15 | b8bb2690181d |
hex | 5b246cdad1fb |
100212003230203 has 4 divisors (see below), whose sum is σ = 100375481213248. Its totient is φ = 100048525247160.
The previous prime is 100212003230173. The next prime is 100212003230231. The reversal of 100212003230203 is 302032300212001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100212003230203 - 245 = 65027631141371 is a prime.
It is a super-2 number, since 2×1002120032302032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100212003230503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81738990603 + ... + 81738991828.
It is an arithmetic number, because the mean of its divisors is an integer number (25093870303312).
Almost surely, 2100212003230203 is an apocalyptic number.
100212003230203 is a deficient number, since it is larger than the sum of its proper divisors (163477983045).
100212003230203 is an equidigital number, since it uses as much as digits as its factorization.
100212003230203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163477983044.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 100212003230203 its reverse (302032300212001), we get a palindrome (402244303442204).
The spelling of 100212003230203 in words is "one hundred trillion, two hundred twelve billion, three million, two hundred thirty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •