Base | Representation |
---|---|
bin | 10010110100000001… |
… | …00100011001001101 |
3 | 222001212222211202001 |
4 | 21122000210121031 |
5 | 131141102024401 |
6 | 4350114432301 |
7 | 505200602434 |
oct | 113200443115 |
9 | 28055884661 |
10 | 10100033101 |
11 | 43132293a4 |
12 | 1b5a592691 |
13 | c4c643062 |
14 | 6bb56211b |
15 | 3e1a6c601 |
hex | 25a02464d |
10100033101 has 4 divisors (see below), whose sum is σ = 10100253600. Its totient is φ = 10099812604.
The previous prime is 10100033071. The next prime is 10100033107. The reversal of 10100033101 is 10133000101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10100033101 - 221 = 10097935949 is a prime.
It is a super-3 number, since 3×101000331013 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100033107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12871 + ... + 142708.
It is an arithmetic number, because the mean of its divisors is an integer number (2525063400).
Almost surely, 210100033101 is an apocalyptic number.
It is an amenable number.
10100033101 is a deficient number, since it is larger than the sum of its proper divisors (220499).
10100033101 is an equidigital number, since it uses as much as digits as its factorization.
10100033101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220498.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 10100033101 its reverse (10133000101), we get a palindrome (20233033202).
The spelling of 10100033101 in words is "ten billion, one hundred million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •