Base | Representation |
---|---|
bin | 10110110001001000011010… |
… | …011111111010101010101000 |
3 | 111010112122120200120120020020 |
4 | 112301020122133322222220 |
5 | 101111041010400111240 |
6 | 552544335240000440 |
7 | 30043251551332533 |
oct | 2661103237725250 |
9 | 433478520516206 |
10 | 100133312113320 |
11 | 299a6332244042 |
12 | b29260b760120 |
13 | 43b46b9281535 |
14 | 1aa269a12ba1a |
15 | b89a6d2ca0d0 |
hex | 5b121a7faaa8 |
100133312113320 has 64 divisors (see below), whose sum is σ = 300444173792640. Its totient is φ = 26698284345600.
The previous prime is 100133312113273. The next prime is 100133312113333. The reversal of 100133312113320 is 23311213331001.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60622591 + ... + 62252430.
It is an arithmetic number, because the mean of its divisors is an integer number (4694440215510).
Almost surely, 2100133312113320 is an apocalyptic number.
100133312113320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100133312113320 is an abundant number, since it is smaller than the sum of its proper divisors (200310861679320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100133312113320 is a wasteful number, since it uses less digits than its factorization.
100133312113320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122881826 (or 122881822 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 100133312113320 its reverse (23311213331001), we get a palindrome (123444525444321).
The spelling of 100133312113320 in words is "one hundred trillion, one hundred thirty-three billion, three hundred twelve million, one hundred thirteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •