Base | Representation |
---|---|
bin | 1011111100011001010000… |
… | …1100000011000011110101 |
3 | 1201111102111200101211111100 |
4 | 2333012110030003003311 |
5 | 3210124222002210401 |
6 | 43532503331200313 |
7 | 2523525121345041 |
oct | 277062414030365 |
9 | 51442450354440 |
10 | 13132201210101 |
11 | 4203376255626 |
12 | 1581137746099 |
13 | 7434908c631c |
14 | 33585d9a5021 |
15 | 17b8ea8a5b86 |
hex | bf1943030f5 |
13132201210101 has 6 divisors (see below), whose sum is σ = 18968735081270. Its totient is φ = 8754800806728.
The previous prime is 13132201210061. The next prime is 13132201210103. The reversal of 13132201210101 is 10101210223131.
13132201210101 is a `hidden beast` number, since 1 + 31 + 322 + 0 + 1 + 210 + 101 = 666.
It can be written as a sum of positive squares in only one way, i.e., 13090835751876 + 41365458225 = 3618126^2 + 203385^2 .
It is not a de Polignac number, because 13132201210101 - 27 = 13132201209973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132201210103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 729566733886 + ... + 729566733903.
Almost surely, 213132201210101 is an apocalyptic number.
It is an amenable number.
13132201210101 is a deficient number, since it is larger than the sum of its proper divisors (5836533871169).
13132201210101 is a wasteful number, since it uses less digits than its factorization.
13132201210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1459133467795 (or 1459133467792 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13132201210101 its reverse (10101210223131), we get a palindrome (23233411433232).
The spelling of 13132201210101 in words is "thirteen trillion, one hundred thirty-two billion, two hundred one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •