Base | Representation |
---|---|
bin | 1100111011010001… |
… | …01111001110010100 |
3 | 122220122012201202110 |
4 | 12131220233032110 |
5 | 103203023410041 |
6 | 3104341111020 |
7 | 333654134202 |
oct | 63550571624 |
9 | 18818181673 |
10 | 6939669396 |
11 | 2a41298370 |
12 | 14180b8470 |
13 | 86797166a |
14 | 49b934072 |
15 | 2a939d516 |
hex | 19da2f394 |
6939669396 has 48 divisors (see below), whose sum is σ = 17669611008. Its totient is φ = 2102335200.
The previous prime is 6939669391. The next prime is 6939669397.
6939669396 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×69396693962 = 96318022651558009632, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6939669391) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 758811 + ... + 767901.
It is an arithmetic number, because the mean of its divisors is an integer number (368116896).
Almost surely, 26939669396 is an apocalyptic number.
6939669396 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
6939669396 is an abundant number, since it is smaller than the sum of its proper divisors (10729941612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6939669396 is a wasteful number, since it uses less digits than its factorization.
6939669396 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14892 (or 14890 counting only the distinct ones).
The product of its digits is 76527504, while the sum is 66.
The square root of 6939669396 is about 83304.6781159378. The cubic root of 6939669396 is about 1907.4196853801.
The spelling of 6939669396 in words is "six billion, nine hundred thirty-nine million, six hundred sixty-nine thousand, three hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •