Base | Representation |
---|---|
bin | 1100000000010110010101… |
… | …1100010000010110100000 |
3 | 1201201220212012110101012222 |
4 | 3000011211130100112200 |
5 | 3212232334410001212 |
6 | 44024020422210212 |
7 | 2531451454110653 |
oct | 300054534202640 |
9 | 51656765411188 |
10 | 13200136406432 |
11 | 422a167969088 |
12 | 1592336b83968 |
13 | 7499c9327051 |
14 | 338c6629389a |
15 | 17d574aa2c72 |
hex | c01657105a0 |
13200136406432 has 12 divisors (see below), whose sum is σ = 25987768550226. Its totient is φ = 6600068203200.
The previous prime is 13200136406417. The next prime is 13200136406437. The reversal of 13200136406432 is 23460463100231.
It can be written as a sum of positive squares in only one way, i.e., 11239363530256 + 1960772876176 = 3352516^2 + 1400276^2 .
It is a super-2 number, since 2×132001364064322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13200136406392 and 13200136406401.
It is not an unprimeable number, because it can be changed into a prime (13200136406437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206252131319 + ... + 206252131382.
Almost surely, 213200136406432 is an apocalyptic number.
It is an amenable number.
13200136406432 is a deficient number, since it is larger than the sum of its proper divisors (12787632143794).
13200136406432 is an equidigital number, since it uses as much as digits as its factorization.
13200136406432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412504262711 (or 412504262703 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 13200136406432 its reverse (23460463100231), we get a palindrome (36660599506663).
The spelling of 13200136406432 in words is "thirteen trillion, two hundred billion, one hundred thirty-six million, four hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •