Base | Representation |
---|---|
bin | 10110110010000111100011… |
… | …001010011001000010110000 |
3 | 111010210010120011110121021101 |
4 | 112302013203022121002300 |
5 | 101113143324404403212 |
6 | 553035430142134144 |
7 | 30051201514142113 |
oct | 2662074312310260 |
9 | 433703504417241 |
10 | 100201103200432 |
11 | 29a2205a579173 |
12 | b2a378a881354 |
13 | 43bac00b96730 |
14 | 1aa5a8b62657a |
15 | b8b6d9a0d157 |
hex | 5b21e32990b0 |
100201103200432 has 80 divisors (see below), whose sum is σ = 219961263265632. Its totient is φ = 43899271280640.
The previous prime is 100201103200343. The next prime is 100201103200439. The reversal of 100201103200432 is 234002301102001.
It is a happy number.
It is a super-2 number, since 2×1002011032004322 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100201103200439) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 158463658 + ... + 159094729.
Almost surely, 2100201103200432 is an apocalyptic number.
It is an amenable number.
100201103200432 is an abundant number, since it is smaller than the sum of its proper divisors (119760160065200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201103200432 is a wasteful number, since it uses less digits than its factorization.
100201103200432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317558486 (or 317558480 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 100201103200432 its reverse (234002301102001), we get a palindrome (334203404302433).
It can be divided in two parts, 100201103 and 200432, that added together give a triangular number (100401535 = T14170).
The spelling of 100201103200432 in words is "one hundred trillion, two hundred one billion, one hundred three million, two hundred thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •