Base | Representation |
---|---|
bin | 11111011011011001010001… |
… | …01010100011000011100100 |
3 | 100001200221120111011111120122 |
4 | 33231230220222203003210 |
5 | 33024303312224032322 |
6 | 402553053333421112 |
7 | 20362051013601161 |
oct | 1755545052430344 |
9 | 301627514144518 |
10 | 69111001002212 |
11 | 200258a13890a4 |
12 | 790221249a798 |
13 | 2c741a7436480 |
14 | 130cdc1531068 |
15 | 7ecb081a5442 |
hex | 3edb28aa30e4 |
69111001002212 has 12 divisors (see below), whose sum is σ = 130247655735036. Its totient is φ = 31897385077920.
The previous prime is 69111001002179. The next prime is 69111001002269. The reversal of 69111001002212 is 21220010011196.
69111001002212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 15819599392996 + 53291401609216 = 3977386^2 + 7300096^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 664528855739 + ... + 664528855842.
It is an arithmetic number, because the mean of its divisors is an integer number (10853971311253).
Almost surely, 269111001002212 is an apocalyptic number.
It is an amenable number.
69111001002212 is a deficient number, since it is larger than the sum of its proper divisors (61136654732824).
69111001002212 is a wasteful number, since it uses less digits than its factorization.
69111001002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1329057711598 (or 1329057711596 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 69111001002212 in words is "sixty-nine trillion, one hundred eleven billion, one million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •