Base | Representation |
---|---|
bin | 11100000101001101010… |
… | …10101000100101110101 |
3 | 10102020111101000000220101 |
4 | 32002212222220211311 |
5 | 111302022412242334 |
6 | 2015131000234101 |
7 | 126465231030022 |
oct | 16024652504565 |
9 | 3366441000811 |
10 | 964868868469 |
11 | 34222035a8a0 |
12 | 136bb876b931 |
13 | 6cca9b5134c |
14 | 349b2764549 |
15 | 1a172432214 |
hex | e0a6aa8975 |
964868868469 has 16 divisors (see below), whose sum is σ = 1054744416000. Its totient is φ = 875355208000.
The previous prime is 964868868461. The next prime is 964868868503.
964868868469 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 964868868469 - 23 = 964868868461 is a prime.
It is a super-2 number, since 2×9648688684692 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 964868868392 and 964868868401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (964868868461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10586907 + ... + 10677655.
It is an arithmetic number, because the mean of its divisors is an integer number (65921526000).
Almost surely, 2964868868469 is an apocalyptic number.
It is an amenable number.
964868868469 is a deficient number, since it is larger than the sum of its proper divisors (89875547531).
964868868469 is a wasteful number, since it uses less digits than its factorization.
964868868469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92732.
The product of its digits is 6879707136, while the sum is 82.
The spelling of 964868868469 in words is "nine hundred sixty-four billion, eight hundred sixty-eight million, eight hundred sixty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •