Base | Representation |
---|---|
bin | 1100000000011011000111… |
… | …1110110001001101011100 |
3 | 1201202001011200202020002010 |
4 | 3000012301332301031130 |
5 | 3212243002123203312 |
6 | 44024352053231220 |
7 | 2531525335654050 |
oct | 300066176611534 |
9 | 51661150666063 |
10 | 13201420522332 |
11 | 422a7667a7399 |
12 | 1592635032510 |
13 | 749b72390143 |
14 | 338d48a3bc60 |
15 | 17d5ec6a693c |
hex | c01b1fb135c |
13201420522332 has 48 divisors (see below), whose sum is σ = 35204321046272. Its totient is φ = 3771777329280.
The previous prime is 13201420522313. The next prime is 13201420522357. The reversal of 13201420522332 is 23322502410231.
It is a super-3 number, since 3×132014205223323 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13201420522332.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4555707 + ... + 6867117.
Almost surely, 213201420522332 is an apocalyptic number.
13201420522332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13201420522332 is an abundant number, since it is smaller than the sum of its proper divisors (22002900523940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201420522332 is a wasteful number, since it uses less digits than its factorization.
13201420522332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2379418 (or 2379416 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 13201420522332 its reverse (23322502410231), we get a palindrome (36523922932563).
The spelling of 13201420522332 in words is "thirteen trillion, two hundred one billion, four hundred twenty million, five hundred twenty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •