Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …001011111010111001011001 |
3 | 111010002212022121222122211122 |
4 | 112233111211023322321121 |
5 | 101102031000321023001 |
6 | 552411544223335025 |
7 | 30031325210161625 |
oct | 2657254513727131 |
9 | 433085277878748 |
10 | 100010011111001 |
11 | 2995900a020032 |
12 | b27273a451475 |
13 | 43a5b99223874 |
14 | 1a9a720628185 |
15 | b86753624b1b |
hex | 5af5652fae59 |
100010011111001 has 8 divisors (see below), whose sum is σ = 101967217887744. Its totient is φ = 98055405276400.
The previous prime is 100010011110943. The next prime is 100010011111039. The reversal of 100010011111001 is 100111110010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010011111001 is a prime.
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 100010011111001.
It is not an unprimeable number, because it can be changed into a prime (100010011110001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 650157881 + ... + 650311686.
It is an arithmetic number, because the mean of its divisors is an integer number (12745902235968).
Almost surely, 2100010011111001 is an apocalyptic number.
It is an amenable number.
100010011111001 is a deficient number, since it is larger than the sum of its proper divisors (1957206776743).
100010011111001 is a wasteful number, since it uses less digits than its factorization.
100010011111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1300471071.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100010011111001 its reverse (100111110010001), we get a palindrome (200121121121002).
The spelling of 100010011111001 in words is "one hundred trillion, ten billion, eleven million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •