Base | Representation |
---|---|
bin | 1100001111010001000100… |
… | …1011000000011100001111 |
3 | 1202122102101002110012021110 |
4 | 3003310101023000130033 |
5 | 3230432222140331211 |
6 | 44341443322503103 |
7 | 2556123435114663 |
oct | 303642113003417 |
9 | 52572332405243 |
10 | 13456420636431 |
11 | 4318921706343 |
12 | 1613b40064a93 |
13 | 767c2031a816 |
14 | 3474195408a3 |
15 | 18507444aea6 |
hex | c3d112c070f |
13456420636431 has 8 divisors (see below), whose sum is σ = 17941934907904. Its totient is φ = 8970926727960.
The previous prime is 13456420636409. The next prime is 13456420636433. The reversal of 13456420636431 is 13463602465431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13456420636431 - 243 = 4660327614223 is a prime.
It is a super-2 number, since 2×134564206364312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13456420636433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3475615 + ... + 6244416.
It is an arithmetic number, because the mean of its divisors is an integer number (2242741863488).
Almost surely, 213456420636431 is an apocalyptic number.
13456420636431 is a deficient number, since it is larger than the sum of its proper divisors (4485514271473).
13456420636431 is an equidigital number, since it uses as much as digits as its factorization.
13456420636431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10181501.
The product of its (nonzero) digits is 3732480, while the sum is 48.
The spelling of 13456420636431 in words is "thirteen trillion, four hundred fifty-six billion, four hundred twenty million, six hundred thirty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •