Base | Representation |
---|---|
bin | 11000010011011100001001… |
… | …110000110110010101100001 |
3 | 112000110111020020020001121102 |
4 | 120103130021300312111201 |
5 | 103002232200303132334 |
6 | 1015200045140204145 |
7 | 31341322301451545 |
oct | 3023341160662541 |
9 | 460414206201542 |
10 | 106889014895969 |
11 | 31070416355149 |
12 | bba3982999655 |
13 | 478478b151687 |
14 | 1c576550b3a25 |
15 | c5566668867e |
hex | 613709c36561 |
106889014895969 has 16 divisors (see below), whose sum is σ = 110644299334800. Its totient is φ = 103138373673216.
The previous prime is 106889014895921. The next prime is 106889014895977. The reversal of 106889014895969 is 969598410988601.
It can be written as a sum of positive squares in 8 ways, for example, as 22347242380369 + 84541772515600 = 4727287^2 + 9194660^2 .
It is not a de Polignac number, because 106889014895969 - 212 = 106889014891873 is a prime.
It is a super-2 number, since 2×1068890148959692 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106889014895989) 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, 490412387 + ... + 490630295.
It is an arithmetic number, because the mean of its divisors is an integer number (6915268708425).
Almost surely, 2106889014895969 is an apocalyptic number.
It is an amenable number.
106889014895969 is a deficient number, since it is larger than the sum of its proper divisors (3755284438831).
106889014895969 is a wasteful number, since it uses less digits than its factorization.
106889014895969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228484.
The product of its (nonzero) digits is 2418647040, while the sum is 83.
The spelling of 106889014895969 in words is "one hundred six trillion, eight hundred eighty-nine billion, fourteen million, eight hundred ninety-five thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •