Base | Representation |
---|---|
bin | 1011110000111000011… |
… | …0101100101110100001 |
3 | 201022122200222211002221 |
4 | 2330032012230232201 |
5 | 11302400111200001 |
6 | 232502110311041 |
7 | 20413141335352 |
oct | 2741606545641 |
9 | 638580884087 |
10 | 202100100001 |
11 | 7878a268438 |
12 | 33202ab8481 |
13 | 1609a4436b7 |
14 | 9ad2d95d29 |
15 | 53cca0b1a1 |
hex | 2f0e1acba1 |
202100100001 has 8 divisors (see below), whose sum is σ = 205149058560. Its totient is φ = 199052098608.
The previous prime is 202100099977. The next prime is 202100100017. The reversal of 202100100001 is 100001001202.
202100100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 202100100001 - 29 = 202100099489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202100100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192000 + ... + 664126.
It is an arithmetic number, because the mean of its divisors is an integer number (25643632320).
Almost surely, 2202100100001 is an apocalyptic number.
It is an amenable number.
202100100001 is a deficient number, since it is larger than the sum of its proper divisors (3048958559).
202100100001 is an equidigital number, since it uses as much as digits as its factorization.
202100100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478583.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 202100100001 its reverse (100001001202), we get a palindrome (302101101203).
The spelling of 202100100001 in words is "two hundred two billion, one hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •