Base | Representation |
---|---|
bin | 1100000000011010010011… |
… | …1001110110101011100011 |
3 | 1201202000121101220221200000 |
4 | 3000012210321312223203 |
5 | 3212242024442131321 |
6 | 44024314215031043 |
7 | 2531520033111633 |
oct | 300064471665343 |
9 | 51660541827600 |
10 | 13201201130211 |
11 | 422a663979896 |
12 | 159259366b483 |
13 | 749b38aa6313 |
14 | 338d2784c6c3 |
15 | 17d5d82bb826 |
hex | c01a4e76ae3 |
13201201130211 has 48 divisors (see below), whose sum is σ = 20328530651520. Its totient is φ = 8555805506880.
The previous prime is 13201201130209. The next prime is 13201201130237. The reversal of 13201201130211 is 11203110210231.
13201201130211 is a `hidden beast` number, since 1 + 320 + 1 + 2 + 0 + 1 + 130 + 211 = 666.
It is not a de Polignac number, because 13201201130211 - 21 = 13201201130209 is a prime.
It is a super-2 number, since 2×132012011302112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13201201135211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 478500 + ... + 5160558.
It is an arithmetic number, because the mean of its divisors is an integer number (423511055240).
Almost surely, 213201201130211 is an apocalyptic number.
13201201130211 is a deficient number, since it is larger than the sum of its proper divisors (7127329521309).
13201201130211 is an equidigital number, since it uses as much as digits as its factorization.
13201201130211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4682398 (or 4682386 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13201201130211 its reverse (11203110210231), we get a palindrome (24404311340442).
The spelling of 13201201130211 in words is "thirteen trillion, two hundred one billion, two hundred one million, one hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •