Base | Representation |
---|---|
bin | 110001001000101110100100… |
… | …100110101110001001011111 |
3 | 1001100011100022012002222021102 |
4 | 301020232210212232021133 |
5 | 211311122034011042114 |
6 | 2043340454223423315 |
7 | 63343000411235024 |
oct | 6110564446561137 |
9 | 1040140265088242 |
10 | 216104041112159 |
11 | 62948233429232 |
12 | 202a24b2154b3b |
13 | 93776a6571145 |
14 | 3b516c457954b |
15 | 19eb566d4b2de |
hex | c48ba49ae25f |
216104041112159 has 8 divisors (see below), whose sum is σ = 217480871401200. Its totient is φ = 214727215525056.
The previous prime is 216104041112117. The next prime is 216104041112161. The reversal of 216104041112159 is 951211140401612.
It is a happy number.
216104041112159 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 216104041112159 - 212 = 216104041108063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216104041112359) 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, 172680812 + ... + 173927774.
It is an arithmetic number, because the mean of its divisors is an integer number (27185108925150).
Almost surely, 2216104041112159 is an apocalyptic number.
216104041112159 is a deficient number, since it is larger than the sum of its proper divisors (1376830289041).
216104041112159 is a wasteful number, since it uses less digits than its factorization.
216104041112159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2350969.
The product of its (nonzero) digits is 17280, while the sum is 38.
The spelling of 216104041112159 in words is "two hundred sixteen trillion, one hundred four billion, forty-one million, one hundred twelve thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •