Base | Representation |
---|---|
bin | 10011111011001110… |
… | …10111101001011001 |
3 | 1000121112001120202200 |
4 | 21331213113221121 |
5 | 133402014011230 |
6 | 4525254320413 |
7 | 526043313462 |
oct | 117547275131 |
9 | 30545046680 |
10 | 10697407065 |
11 | 459a453294 |
12 | 20a6659109 |
13 | 101632c587 |
14 | 736a23d69 |
15 | 42921c160 |
hex | 27d9d7a59 |
10697407065 has 48 divisors (see below), whose sum is σ = 19565919360. Its totient is φ = 5395864320.
The previous prime is 10697407051. The next prime is 10697407067. The reversal of 10697407065 is 56070479601.
It is a happy number.
It is not a de Polignac number, because 10697407065 - 230 = 9623665241 is a prime.
It is a super-2 number, since 2×106974070652 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 10697407065.
It is not an unprimeable number, because it can be changed into a prime (10697407067) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 34050 + ... + 150180.
It is an arithmetic number, because the mean of its divisors is an integer number (407623320).
Almost surely, 210697407065 is an apocalyptic number.
10697407065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10697407065 is a deficient number, since it is larger than the sum of its proper divisors (8868512295).
10697407065 is a wasteful number, since it uses less digits than its factorization.
10697407065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116254 (or 116251 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 45.
The spelling of 10697407065 in words is "ten billion, six hundred ninety-seven million, four hundred seven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •