Base | Representation |
---|---|
bin | 10110110111000000110110… |
… | …101101010001000111110000 |
3 | 111011222021220002112120121012 |
4 | 112313000312231101013300 |
5 | 101134201311122113130 |
6 | 553454143500450052 |
7 | 30114411164256023 |
oct | 2667006655210760 |
9 | 434867802476535 |
10 | 100537512301040 |
11 | 2a0417a0760661 |
12 | b338a15549928 |
13 | 4413853b32b49 |
14 | 1ab80820751ba |
15 | b953287dd995 |
hex | 5b7036b511f0 |
100537512301040 has 40 divisors (see below), whose sum is σ = 234060967526208. Its totient is φ = 40161456288000.
The previous prime is 100537512301033. The next prime is 100537512301091. The reversal of 100537512301040 is 40103215735001.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 100537512300988 and 100537512301006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 836636927 + ... + 836757086.
Almost surely, 2100537512301040 is an apocalyptic number.
100537512301040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100537512301040 is an abundant number, since it is smaller than the sum of its proper divisors (133523455225168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100537512301040 is a wasteful number, since it uses less digits than its factorization.
100537512301040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1673394777 (or 1673394771 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 100537512301040 in words is "one hundred trillion, five hundred thirty-seven billion, five hundred twelve million, three hundred one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •