Base | Representation |
---|---|
bin | 10111000010000110… |
… | …10000100011000001 |
3 | 1011220210011201212100 |
4 | 23201003100203001 |
5 | 200311102144101 |
6 | 5403011021013 |
7 | 615301252611 |
oct | 134103204301 |
9 | 34823151770 |
10 | 12365662401 |
11 | 5276104204 |
12 | 249129a769 |
13 | 1220b42a01 |
14 | 854404a41 |
15 | 4c58eee86 |
hex | 2e10d08c1 |
12365662401 has 27 divisors (see below), whose sum is σ = 18089399523. Its totient is φ = 8139913200.
The previous prime is 12365662391. The next prime is 12365662469. The reversal of 12365662401 is 10426656321.
The square root of 12365662401 is 111201.
It is a perfect power (a square), and thus also a powerful number.
12365662401 is a `hidden beast` number, since 1 + 23 + 6 + 5 + 6 + 624 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 11880782001 + 484880400 = 108999^2 + 22020^2 .
It is a de Polignac number, because none of the positive numbers 2k-12365662401 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12365667401) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 33693720 + ... + 33694086.
Almost surely, 212365662401 is an apocalyptic number.
12365662401 is the 111201-st square number.
12365662401 is the 55601-st centered octagonal number.
It is an amenable number.
12365662401 is a deficient number, since it is larger than the sum of its proper divisors (5723737122).
12365662401 is an frugal number, since it uses more digits than its factorization.
12365662401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942 (or 471 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Multiplying 12365662401 by its sum of digits (36), we get a square (445163846436 = 6672062).
The spelling of 12365662401 in words is "twelve billion, three hundred sixty-five million, six hundred sixty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •