Base | Representation |
---|---|
bin | 10100010011100001… |
… | …01111010111010101 |
3 | 1001010201111211112112 |
4 | 22021300233113111 |
5 | 134311201040401 |
6 | 5001414200405 |
7 | 534066405224 |
oct | 121160572725 |
9 | 31121454475 |
10 | 10901190101 |
11 | 469448a51a |
12 | 2142953105 |
13 | 104960c759 |
14 | 755b0ccbb |
15 | 43c0723bb |
hex | 289c2f5d5 |
10901190101 has 4 divisors (see below), whose sum is σ = 11375154912. Its totient is φ = 10427225292.
The previous prime is 10901190073. The next prime is 10901190127. The reversal of 10901190101 is 10109110901.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-10901190101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 473964787 = 10901190101 / (1 + 0 + 9 + 0 + 1 + 1 + 9 + 0 + 1 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10901190191) 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, 236982371 + ... + 236982416.
It is an arithmetic number, because the mean of its divisors is an integer number (2843788728).
Almost surely, 210901190101 is an apocalyptic number.
It is an amenable number.
10901190101 is a deficient number, since it is larger than the sum of its proper divisors (473964811).
10901190101 is an equidigital number, since it uses as much as digits as its factorization.
10901190101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 473964810.
The product of its (nonzero) digits is 81, while the sum is 23.
The spelling of 10901190101 in words is "ten billion, nine hundred one million, one hundred ninety thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •