Base | Representation |
---|---|
bin | 10110110001000111010101… |
… | …101001100000111011011011 |
3 | 111010112112121012000210121120 |
4 | 112301013111221200323123 |
5 | 101111031124143021220 |
6 | 552544024453540323 |
7 | 30043211124131436 |
oct | 2661072551407333 |
9 | 433475535023546 |
10 | 100132157001435 |
11 | 299a589a207419 |
12 | b2923489446a3 |
13 | 43b4563b75790 |
14 | 1aa25ca96481d |
15 | b89a01ba9a40 |
hex | 5b11d5a60edb |
100132157001435 has 128 divisors (see below), whose sum is σ = 174602469888000. Its totient is φ = 48707950786560.
The previous prime is 100132157001377. The next prime is 100132157001439. The reversal of 100132157001435 is 534100751231001.
It is not a de Polignac number, because 100132157001435 - 215 = 100132156968667 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100132157001396 and 100132157001405.
It is not an unprimeable number, because it can be changed into a prime (100132157001439) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 12999107794 + ... + 12999115496.
It is an arithmetic number, because the mean of its divisors is an integer number (1364081796000).
Almost surely, 2100132157001435 is an apocalyptic number.
100132157001435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
100132157001435 is a deficient number, since it is larger than the sum of its proper divisors (74470312886565).
100132157001435 is a wasteful number, since it uses less digits than its factorization.
100132157001435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9453.
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 100132157001435 in words is "one hundred trillion, one hundred thirty-two billion, one hundred fifty-seven million, one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •