Base | Representation |
---|---|
bin | 110000111010111000… |
… | …1011010000001001001 |
3 | 101001011110201002011201 |
4 | 1201311301122001021 |
5 | 3210123101213001 |
6 | 120132303224201 |
7 | 10406235424204 |
oct | 1416561320111 |
9 | 331143632151 |
10 | 105055101001 |
11 | 4060a958324 |
12 | 1843a8a8061 |
13 | 9ba2bc1476 |
14 | 512858693b |
15 | 2aece27501 |
hex | 1875c5a049 |
105055101001 has 8 divisors (see below), whose sum is σ = 111691068480. Its totient is φ = 98591496432.
The previous prime is 105055100993. The next prime is 105055101013. The reversal of 105055101001 is 100101550501.
It is a happy number.
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 105055101001 - 23 = 105055100993 is a prime.
It is a super-2 number, since 2×1050551010012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105055101001.
It is not an unprimeable number, because it can be changed into a prime (105055101071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43089471 + ... + 43091908.
It is an arithmetic number, because the mean of its divisors is an integer number (13961383560).
Almost surely, 2105055101001 is an apocalyptic number.
It is an amenable number.
105055101001 is a deficient number, since it is larger than the sum of its proper divisors (6635967479).
105055101001 is an equidigital number, since it uses as much as digits as its factorization.
105055101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86181455.
The product of its (nonzero) digits is 125, while the sum is 19.
Adding to 105055101001 its reverse (100101550501), we get a palindrome (205156651502).
The spelling of 105055101001 in words is "one hundred five billion, fifty-five million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •