Base | Representation |
---|---|
bin | 10010110010110110… |
… | …00011100000111101 |
3 | 222001012111020000211 |
4 | 21121123003200331 |
5 | 131131042332401 |
6 | 4345123552421 |
7 | 505021164043 |
oct | 113133034075 |
9 | 28035436024 |
10 | 10090199101 |
11 | 4308721a24 |
12 | 1b5722b711 |
13 | c4a5abc18 |
14 | 6ba122393 |
15 | 3e0c78951 |
hex | 2596c383d |
10090199101 has 8 divisors (see below), whose sum is σ = 10116207360. Its totient is φ = 10064225808.
The previous prime is 10090199069. The next prime is 10090199111. The reversal of 10090199101 is 10199109001.
10090199101 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 10090199101 - 25 = 10090199069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10090199111) 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 7 ways as a sum of consecutive naturals, for example, 627180 + ... + 643066.
It is an arithmetic number, because the mean of its divisors is an integer number (1264525920).
Almost surely, 210090199101 is an apocalyptic number.
It is an amenable number.
10090199101 is a deficient number, since it is larger than the sum of its proper divisors (26008259).
10090199101 is an equidigital number, since it uses as much as digits as its factorization.
10090199101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17483.
The product of its (nonzero) digits is 729, while the sum is 31.
It can be divided in two parts, 100901 and 99101, that added together give a palindrome (200002).
The spelling of 10090199101 in words is "ten billion, ninety million, one hundred ninety-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •