Base | Representation |
---|---|
bin | 101110100100100010… |
… | …0101001100001001100 |
3 | 100120010212211201102110 |
4 | 1131021010221201030 |
5 | 3114310103000322 |
6 | 113535525424020 |
7 | 10140226462323 |
oct | 1351104514114 |
9 | 316125751373 |
10 | 100010203212 |
11 | 39461174a07 |
12 | 1747126b010 |
13 | 957a97294a |
14 | 4baa5590ba |
15 | 29050a2c0c |
hex | 174912984c |
100010203212 has 12 divisors (see below), whose sum is σ = 233357140856. Its totient is φ = 33336734400.
The previous prime is 100010203211. The next prime is 100010203217. The reversal of 100010203212 is 212302010001.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 8334183601 = 100010203212 / (1 + 0 + 0 + 0 + 1 + 0 + 2 + 0 + 3 + 2 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (100010203211) 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, 4167091789 + ... + 4167091812.
Almost surely, 2100010203212 is an apocalyptic number.
100010203212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100010203212 is an abundant number, since it is smaller than the sum of its proper divisors (133346937644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010203212 is a wasteful number, since it uses less digits than its factorization.
100010203212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8334183608 (or 8334183606 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 100010203212 its reverse (212302010001), we get a palindrome (312312213213).
The spelling of 100010203212 in words is "one hundred billion, ten million, two hundred three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •