Base | Representation |
---|---|
bin | 10100110101010100100… |
… | …000001101110000011101 |
3 | 12001212022120200211211122 |
4 | 110311110200031300131 |
5 | 141424000302400134 |
6 | 3013404233100325 |
7 | 205301263601255 |
oct | 24652440156035 |
9 | 5055276624748 |
10 | 1431641840669 |
11 | 502179550537 |
12 | 1b1565b576a5 |
13 | a5007194311 |
14 | 4d412b1a965 |
15 | 27390ea002e |
hex | 14d5480dc1d |
1431641840669 has 2 divisors, whose sum is σ = 1431641840670. Its totient is φ = 1431641840668.
The previous prime is 1431641840633. The next prime is 1431641840719. The reversal of 1431641840669 is 9660481461341.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1027005908569 + 404635932100 = 1013413^2 + 636110^2 .
It is a cyclic number.
It is not a de Polignac number, because 1431641840669 - 28 = 1431641840413 is a prime.
It is a super-2 number, since 2×14316418406692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1431641840669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1431641842669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 715820920334 + 715820920335.
It is an arithmetic number, because the mean of its divisors is an integer number (715820920335).
Almost surely, 21431641840669 is an apocalyptic number.
It is an amenable number.
1431641840669 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431641840669 is an equidigital number, since it uses as much as digits as its factorization.
1431641840669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2985984, while the sum is 53.
The spelling of 1431641840669 in words is "one trillion, four hundred thirty-one billion, six hundred forty-one million, eight hundred forty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •