Base | Representation |
---|---|
bin | 10111000110010101… |
… | …01011001101101001 |
3 | 1012000020222020212200 |
4 | 23203022223031221 |
5 | 200344144123230 |
6 | 5410315530413 |
7 | 616212062346 |
oct | 134312531551 |
9 | 35006866780 |
10 | 12401161065 |
11 | 529414a947 |
12 | 24a1159a09 |
13 | 12282c1737 |
14 | 8590057cd |
15 | 4c8ab3160 |
hex | 2e32ab369 |
12401161065 has 24 divisors (see below), whose sum is σ = 21579005448. Its totient is φ = 6588211200.
The previous prime is 12401161061. The next prime is 12401161127. The reversal of 12401161065 is 56016110421.
12401161065 is a `hidden beast` number, since 1 + 2 + 40 + 1 + 1 + 610 + 6 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 2235682089 + 10165478976 = 47283^2 + 100824^2 .
It is not a de Polignac number, because 12401161065 - 22 = 12401161061 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12401161061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 524586 + ... + 547715.
It is an arithmetic number, because the mean of its divisors is an integer number (899125227).
Almost surely, 212401161065 is an apocalyptic number.
12401161065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12401161065 is a deficient number, since it is larger than the sum of its proper divisors (9177844383).
12401161065 is a wasteful number, since it uses less digits than its factorization.
12401161065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1072569 (or 1072566 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 12401161065 its reverse (56016110421), we get a palindrome (68417271486).
The spelling of 12401161065 in words is "twelve billion, four hundred one million, one hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •