Base | Representation |
---|---|
bin | 1001100001010110100011010… |
… | …0100011001011110111100111 |
3 | 10020212020102022202120221001100 |
4 | 2120111220310203023313213 |
5 | 1200304104020030323421 |
6 | 10332541054515531143 |
7 | 261060116012355156 |
oct | 23025506443136747 |
9 | 3225212282527040 |
10 | 669990010011111 |
11 | 1845301930585a9 |
12 | 631886768b9ab3 |
13 | 229aca2c91caaa |
14 | bb6399201959d |
15 | 526ce9eb31c26 |
hex | 2615a348cbde7 |
669990010011111 has 24 divisors (see below), whose sum is σ = 981418494944160. Its totient is φ = 440357947444800.
The previous prime is 669990010011083. The next prime is 669990010011139. The reversal of 669990010011111 is 111110010099966.
It is an interprime number because it is at equal distance from previous prime (669990010011083) and next prime (669990010011139).
It is not a de Polignac number, because 669990010011111 - 214 = 669990009994727 is a prime.
It is a super-2 number, since 2×6699900100111112 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (669990010011011) 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, 12288241 + ... + 38613221.
It is an arithmetic number, because the mean of its divisors is an integer number (40892437289340).
Almost surely, 2669990010011111 is an apocalyptic number.
669990010011111 is a deficient number, since it is larger than the sum of its proper divisors (311428484933049).
669990010011111 is a wasteful number, since it uses less digits than its factorization.
669990010011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26364887 (or 26364884 counting only the distinct ones).
The product of its (nonzero) digits is 26244, while the sum is 45.
The spelling of 669990010011111 in words is "six hundred sixty-nine trillion, nine hundred ninety billion, ten million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •