Base | Representation |
---|---|
bin | 11111011000011101010101… |
… | …00000001100001010111011 |
3 | 100001100022010112100002120010 |
4 | 33230032222200030022323 |
5 | 33021130141112010021 |
6 | 402434445145233003 |
7 | 20351546420266614 |
oct | 1754165240141273 |
9 | 301308115302503 |
10 | 69010100110011 |
11 | 1aa97023471395 |
12 | 78a6752a92763 |
13 | 2c678170aa228 |
14 | 130816c9a0c0b |
15 | 7ea19ed14976 |
hex | 3ec3aa80c2bb |
69010100110011 has 16 divisors (see below), whose sum is σ = 93575245276800. Its totient is φ = 45225881311488.
The previous prime is 69010100109997. The next prime is 69010100110013. The reversal of 69010100110011 is 11001100101096.
69010100110011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 69010100110011 - 237 = 68872661156539 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 69010100110011.
It is not an unprimeable number, because it can be changed into a prime (69010100110013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2846155 + ... + 12088043.
It is an arithmetic number, because the mean of its divisors is an integer number (5848452829800).
Almost surely, 269010100110011 is an apocalyptic number.
69010100110011 is a deficient number, since it is larger than the sum of its proper divisors (24565145166789).
69010100110011 is a wasteful number, since it uses less digits than its factorization.
69010100110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9284138.
The product of its (nonzero) digits is 54, while the sum is 21.
The spelling of 69010100110011 in words is "sixty-nine trillion, ten billion, one hundred million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •