Base | Representation |
---|---|
bin | 10110110011100011110110… |
… | …011000110111100000111100 |
3 | 111011010121101002102011211100 |
4 | 112303203312120313200330 |
5 | 101121304312230311142 |
6 | 553153140321053100 |
7 | 30061310464133304 |
oct | 2663436630674074 |
9 | 434117332364740 |
10 | 100300210010172 |
11 | 29a600978031a7 |
12 | b2baa29487190 |
13 | 43c7366625213 |
14 | 1aaa7adbc0604 |
15 | b8e08a613b4c |
hex | 5b38f663783c |
100300210010172 has 144 divisors (see below), whose sum is σ = 267056627568640. Its totient is φ = 31652876082816.
The previous prime is 100300210010089. The next prime is 100300210010173. The reversal of 100300210010172 is 271010012003001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100300210010173) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11135802093 + ... + 11135811099.
Almost surely, 2100300210010172 is an apocalyptic number.
100300210010172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100300210010172 is an abundant number, since it is smaller than the sum of its proper divisors (166756417558468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100300210010172 is a wasteful number, since it uses less digits than its factorization.
100300210010172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17960 (or 17955 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
Adding to 100300210010172 its reverse (271010012003001), we get a palindrome (371310222013173).
The spelling of 100300210010172 in words is "one hundred trillion, three hundred billion, two hundred ten million, ten thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •