Base | Representation |
---|---|
bin | 1011010001110011000111… |
… | …0011011110010001010101 |
3 | 1121220110121121220120012121 |
4 | 2310130301303132101111 |
5 | 3111132012434113334 |
6 | 42212400135415541 |
7 | 2416620424143565 |
oct | 264346163362125 |
9 | 47813547816177 |
10 | 12400406160469 |
11 | 3a50a89aaa608 |
12 | 1483346b245b1 |
13 | 6bc479218562 |
14 | 30c27baaada5 |
15 | 16786a2e7db4 |
hex | b4731cde455 |
12400406160469 has 2 divisors, whose sum is σ = 12400406160470. Its totient is φ = 12400406160468.
The previous prime is 12400406160451. The next prime is 12400406160529. The reversal of 12400406160469 is 96406160400421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11361362318244 + 1039043842225 = 3370662^2 + 1019335^2 .
It is a cyclic number.
It is not a de Polignac number, because 12400406160469 - 25 = 12400406160437 is a prime.
It is a super-2 number, since 2×124004061604692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12400406166469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6200203080234 + 6200203080235.
It is an arithmetic number, because the mean of its divisors is an integer number (6200203080235).
Almost surely, 212400406160469 is an apocalyptic number.
It is an amenable number.
12400406160469 is a deficient number, since it is larger than the sum of its proper divisors (1).
12400406160469 is an equidigital number, since it uses as much as digits as its factorization.
12400406160469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 12400406160469 in words is "twelve trillion, four hundred billion, four hundred six million, one hundred sixty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •