Base | Representation |
---|---|
bin | 101110101000110100… |
… | …0010101000000000001 |
3 | 100120111212222212122001 |
4 | 1131101220111000001 |
5 | 3120103331232311 |
6 | 114002054544001 |
7 | 10143622014304 |
oct | 1352150250001 |
9 | 316455885561 |
10 | 100153774081 |
11 | 39525215919 |
12 | 174b1368001 |
13 | 95a163041a |
14 | 4bc164cb3b |
15 | 29129b24c1 |
hex | 1751a15001 |
100153774081 has 8 divisors (see below), whose sum is σ = 100449180000. Its totient is φ = 99858715008.
The previous prime is 100153774079. The next prime is 100153774099. The reversal of 100153774081 is 180477351001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100153774081 - 21 = 100153774079 is a prime.
It is a super-2 number, since 2×1001537740812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100153774081.
It is not an unprimeable number, because it can be changed into a prime (100153774001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 497430 + ... + 669136.
It is an arithmetic number, because the mean of its divisors is an integer number (12556147500).
Almost surely, 2100153774081 is an apocalyptic number.
It is an amenable number.
100153774081 is a deficient number, since it is larger than the sum of its proper divisors (295405919).
100153774081 is a wasteful number, since it uses less digits than its factorization.
100153774081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173423.
The product of its (nonzero) digits is 23520, while the sum is 37.
The spelling of 100153774081 in words is "one hundred billion, one hundred fifty-three million, seven hundred seventy-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •