Base | Representation |
---|---|
bin | 100000111110110000011000… |
… | …1011110000101001010111111 |
3 | 1102001011022001211102112002200 |
4 | 1001331200301132011022333 |
5 | 301011000001324310421 |
6 | 2504554051355122543 |
7 | 115051016640501210 |
oct | 10175406136051277 |
9 | 1361138054375080 |
10 | 290100101010111 |
11 | 84486842142a37 |
12 | 28653414a43453 |
13 | c5b4425994532 |
14 | 518ccc3d3d407 |
15 | 2381281959726 |
hex | 107d8317852bf |
290100101010111 has 24 divisors (see below), whose sum is σ = 480803354688384. Its totient is φ = 165111042114000.
The previous prime is 290100101010103. The next prime is 290100101010133. The reversal of 290100101010111 is 111010101001092.
It is not a de Polignac number, because 290100101010111 - 23 = 290100101010103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (290100101010211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9172819861 + ... + 9172851486.
It is an arithmetic number, because the mean of its divisors is an integer number (20033473112016).
Almost surely, 2290100101010111 is an apocalyptic number.
290100101010111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
290100101010111 is a deficient number, since it is larger than the sum of its proper divisors (190703253678273).
290100101010111 is a wasteful number, since it uses less digits than its factorization.
290100101010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18345671611 (or 18345671608 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
The spelling of 290100101010111 in words is "two hundred ninety trillion, one hundred billion, one hundred one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •