Base | Representation |
---|---|
bin | 11111100010111000101101… |
… | …10011011101011100011101 |
3 | 100002121112222000122012211222 |
4 | 33301130112303131130131 |
5 | 33043012440220331042 |
6 | 403311222554223125 |
7 | 20416462414012136 |
oct | 1761342663353435 |
9 | 302545860565758 |
10 | 69368399386397 |
11 | 20114a78028941 |
12 | 7944088724aa5 |
13 | 2c925481c5287 |
14 | 131b63c762c8d |
15 | 80467077d2d2 |
hex | 3f1716cdd71d |
69368399386397 has 16 divisors (see below), whose sum is σ = 72591572136960. Its totient is φ = 66206935267200.
The previous prime is 69368399386337. The next prime is 69368399386487. The reversal of 69368399386397 is 79368399386396.
It is a cyclic number.
It is not a de Polignac number, because 69368399386397 - 28 = 69368399386141 is a prime.
It is a super-2 number, since 2×693683993863972 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69368399386337) 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, 35229179 + ... + 37146087.
It is an arithmetic number, because the mean of its divisors is an integer number (4536973258560).
Almost surely, 269368399386397 is an apocalyptic number.
It is an amenable number.
69368399386397 is a deficient number, since it is larger than the sum of its proper divisors (3223172750563).
69368399386397 is a wasteful number, since it uses less digits than its factorization.
69368399386397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1933004.
The product of its digits is 51426482688, while the sum is 89.
Subtracting 69368399386397 from its reverse (79368399386396), we obtain a palindrome (9999999999999).
The spelling of 69368399386397 in words is "sixty-nine trillion, three hundred sixty-eight billion, three hundred ninety-nine million, three hundred eighty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •