Base | Representation |
---|---|
bin | 101110101010101100… |
… | …0001111011000101001 |
3 | 100120200021100002122002 |
4 | 1131111120033120221 |
5 | 3120220431300031 |
6 | 114012222540345 |
7 | 10145314413521 |
oct | 1352530173051 |
9 | 316607302562 |
10 | 100216665641 |
11 | 39557771214 |
12 | 1750a4376b5 |
13 | 95b1680571 |
14 | 4bc9b40681 |
15 | 2918286ccb |
hex | 175560f629 |
100216665641 has 4 divisors (see below), whose sum is σ = 100233190032. Its totient is φ = 100200141252.
The previous prime is 100216665623. The next prime is 100216665691. The reversal of 100216665641 is 146566612001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100216665641 - 214 = 100216649257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100216665595 and 100216665604.
It is not an unprimeable number, because it can be changed into a prime (100216665691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8253095 + ... + 8265228.
It is an arithmetic number, because the mean of its divisors is an integer number (25058297508).
Almost surely, 2100216665641 is an apocalyptic number.
It is an amenable number.
100216665641 is a deficient number, since it is larger than the sum of its proper divisors (16524391).
100216665641 is an equidigital number, since it uses as much as digits as its factorization.
100216665641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16524390.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 100216665641 in words is "one hundred billion, two hundred sixteen million, six hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •