Base | Representation |
---|---|
bin | 100000001011010010… |
… | …1000011000100001000 |
3 | 20121100120121200200110 |
4 | 1000112211003010020 |
5 | 2113003130143433 |
6 | 51424320034320 |
7 | 4664214515565 |
oct | 1002645030410 |
9 | 217316550613 |
10 | 69098287368 |
11 | 27339200020 |
12 | 11484a629a0 |
13 | 66926a1596 |
14 | 34b6d7186c |
15 | 1be6396963 |
hex | 1016943108 |
69098287368 has 32 divisors (see below), whose sum is σ = 188449875360. Its totient is φ = 20938874880.
The previous prime is 69098287361. The next prime is 69098287417. The reversal of 69098287368 is 86378289096.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 69098287299 and 69098287308.
It is not an unprimeable number, because it can be changed into a prime (69098287361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130867705 + ... + 130868232.
It is an arithmetic number, because the mean of its divisors is an integer number (5889058605).
Almost surely, 269098287368 is an apocalyptic number.
It is an amenable number.
69098287368 is an abundant number, since it is smaller than the sum of its proper divisors (119351587992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69098287368 is a wasteful number, since it uses less digits than its factorization.
69098287368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261735957 (or 261735953 counting only the distinct ones).
The product of its (nonzero) digits is 62705664, while the sum is 66.
It can be divided in two parts, 6909828 and 7368, that added together give a palindrome (6917196).
The spelling of 69098287368 in words is "sixty-nine billion, ninety-eight million, two hundred eighty-seven thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •