Base | Representation |
---|---|
bin | 1100000000011010000001… |
… | …1100000010101111000101 |
3 | 1201202000102011221102112020 |
4 | 3000012200130002233011 |
5 | 3212241401302101110 |
6 | 44024302541113353 |
7 | 2531515133220114 |
oct | 300064034025705 |
9 | 51660364842466 |
10 | 13201126206405 |
11 | 422a625655495 |
12 | 1592572558859 |
13 | 749b264025c7 |
14 | 338d1b907c7b |
15 | 17d5d191bd70 |
hex | c01a0702bc5 |
13201126206405 has 8 divisors (see below), whose sum is σ = 21121801930272. Its totient is φ = 7040600643408.
The previous prime is 13201126206343. The next prime is 13201126206409. The reversal of 13201126206405 is 50460262110231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13201126206405 - 210 = 13201126205381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201126206409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 440037540199 + ... + 440037540228.
It is an arithmetic number, because the mean of its divisors is an integer number (2640225241284).
Almost surely, 213201126206405 is an apocalyptic number.
13201126206405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13201126206405 is a deficient number, since it is larger than the sum of its proper divisors (7920675723867).
13201126206405 is an equidigital number, since it uses as much as digits as its factorization.
13201126206405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 880075080435.
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 13201126206405 its reverse (50460262110231), we get a palindrome (63661388316636).
The spelling of 13201126206405 in words is "thirteen trillion, two hundred one billion, one hundred twenty-six million, two hundred six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •