Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1101110110111110101 |
3 | 100120010020121200201100 |
4 | 1131020201232313311 |
5 | 3114300232100401 |
6 | 113535001320313 |
7 | 10140055621011 |
oct | 1351041566765 |
9 | 316106550640 |
10 | 100001050101 |
11 | 39456a93057 |
12 | 1746a196099 |
13 | 9578ab96c4 |
14 | 4ba9255541 |
15 | 2904395b86 |
hex | 174886edf5 |
100001050101 has 12 divisors (see below), whose sum is σ = 144460281420. Its totient is φ = 66660757440.
The previous prime is 100001050091. The next prime is 100001050109. The reversal of 100001050101 is 101050100001.
It can be written as a sum of positive squares in 2 ways, for example, as 37393503876 + 62607546225 = 193374^2 + 250215^2 .
It is not a de Polignac number, because 100001050101 - 222 = 99996855797 is a prime.
It is a super-2 number, since 2×1000010501012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001050109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 454056 + ... + 637313.
It is an arithmetic number, because the mean of its divisors is an integer number (12038356785).
Almost surely, 2100001050101 is an apocalyptic number.
It is an amenable number.
100001050101 is a deficient number, since it is larger than the sum of its proper divisors (44459231319).
100001050101 is a wasteful number, since it uses less digits than its factorization.
100001050101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101556 (or 1101553 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 100001050101 its reverse (101050100001), we get a palindrome (201051150102).
The spelling of 100001050101 in words is "one hundred billion, one million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •