Base | Representation |
---|---|
bin | 10110110000100000001111… |
… | …011110110000100001110000 |
3 | 111010101112020120100121101220 |
4 | 112300200033132300201300 |
5 | 101104334140430243222 |
6 | 552512443125225040 |
7 | 30040163623035123 |
oct | 2660401736604160 |
9 | 433345216317356 |
10 | 100090177587312 |
11 | 2998a0079a2240 |
12 | b286191b62180 |
13 | 43b06039a5b73 |
14 | 1aa056753a3ba |
15 | b88896529b5c |
hex | 5b080f7b0870 |
100090177587312 has 160 divisors (see below), whose sum is σ = 302263181418240. Its totient is φ = 28202287656960.
The previous prime is 100090177587311. The next prime is 100090177587331. The reversal of 100090177587312 is 213785771090001.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100090177587311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66428887 + ... + 67918902.
It is an arithmetic number, because the mean of its divisors is an integer number (1889144883864).
Almost surely, 2100090177587312 is an apocalyptic number.
100090177587312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100090177587312 is an abundant number, since it is smaller than the sum of its proper divisors (202173003830928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100090177587312 is a wasteful number, since it uses less digits than its factorization.
100090177587312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134347911 (or 134347905 counting only the distinct ones).
The product of its (nonzero) digits is 740880, while the sum is 51.
The spelling of 100090177587312 in words is "one hundred trillion, ninety billion, one hundred seventy-seven million, five hundred eighty-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •