Base | Representation |
---|---|
bin | 101110101101011110… |
… | …1000101110110110101 |
3 | 100120220210100202010211 |
4 | 1131122331011312311 |
5 | 3120413403241041 |
6 | 114025403545421 |
7 | 10150531506505 |
oct | 1353275056665 |
9 | 316823322124 |
10 | 100310212021 |
11 | 395a5554a78 |
12 | 1753582b271 |
13 | 95c7b74756 |
14 | 4bd8331a05 |
15 | 29215b4481 |
hex | 175af45db5 |
100310212021 has 8 divisors (see below), whose sum is σ = 103561516800. Its totient is φ = 97059875520.
The previous prime is 100310211973. The next prime is 100310212027. The reversal of 100310212021 is 120212013001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100310212021 - 211 = 100310209973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100310211992 and 100310212010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100310212027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28516 + ... + 448813.
It is an arithmetic number, because the mean of its divisors is an integer number (12945189600).
Almost surely, 2100310212021 is an apocalyptic number.
It is an amenable number.
100310212021 is a deficient number, since it is larger than the sum of its proper divisors (3251304779).
100310212021 is an equidigital number, since it uses as much as digits as its factorization.
100310212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484139.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100310212021 its reverse (120212013001), we get a palindrome (220522225022).
The spelling of 100310212021 in words is "one hundred billion, three hundred ten million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •