Base | Representation |
---|---|
bin | 1100000010010… |
… | …00110000010101 |
3 | 21000222100212110 |
4 | 12001020300111 |
5 | 201321230201 |
6 | 14003541233 |
7 | 2334104550 |
oct | 601106025 |
9 | 230870773 |
10 | 100961301 |
11 | 51a987a1 |
12 | 2998a819 |
13 | 17bbc21c |
14 | d5a1697 |
15 | 8ce46d6 |
hex | 6048c15 |
100961301 has 8 divisors (see below), whose sum is σ = 153845824. Its totient is φ = 57692160.
The previous prime is 100961297. The next prime is 100961303. The reversal of 100961301 is 103169001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100961301 - 22 = 100961297 is a prime.
It is a super-2 number, since 2×1009613012 = 20386368599225202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4807681 = 100961301 / (1 + 0 + 0 + 9 + 6 + 1 + 3 + 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 (100961303) 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, 2403820 + ... + 2403861.
It is an arithmetic number, because the mean of its divisors is an integer number (19230728).
Almost surely, 2100961301 is an apocalyptic number.
It is an amenable number.
100961301 is a deficient number, since it is larger than the sum of its proper divisors (52884523).
100961301 is an equidigital number, since it uses as much as digits as its factorization.
100961301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4807691.
The product of its (nonzero) digits is 162, while the sum is 21.
The square root of 100961301 is about 10047.9500894461. The cubic root of 100961301 is about 465.6414641026.
The spelling of 100961301 in words is "one hundred million, nine hundred sixty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •