Base | Representation |
---|---|
bin | 1011111100011000111101… |
… | …1110010110110000100101 |
3 | 1201111102022011120210210121 |
4 | 2333012033132112300211 |
5 | 3210124041230421201 |
6 | 43532451424121541 |
7 | 2523523141204216 |
oct | 277061736266045 |
9 | 51442264523717 |
10 | 13132122123301 |
11 | 4203335648535 |
12 | 15811151662b1 |
13 | 74347a3c57bc |
14 | 33585329940d |
15 | 17b8e39829a1 |
hex | bf18f796c25 |
13132122123301 has 8 divisors (see below), whose sum is σ = 13823327527520. Its totient is φ = 12440920827312.
The previous prime is 13132122123299. The next prime is 13132122123311. The reversal of 13132122123301 is 10332122123131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13132122123301 - 21 = 13132122123299 is a prime.
It is a super-2 number, since 2×131321221233012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132122123311) 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, 7241011 + ... + 8871103.
It is an arithmetic number, because the mean of its divisors is an integer number (1727915940940).
Almost surely, 213132122123301 is an apocalyptic number.
It is an amenable number.
13132122123301 is a deficient number, since it is larger than the sum of its proper divisors (691205404219).
13132122123301 is a wasteful number, since it uses less digits than its factorization.
13132122123301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2054115.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13132122123301 its reverse (10332122123131), we get a palindrome (23464244246432).
The spelling of 13132122123301 in words is "thirteen trillion, one hundred thirty-two billion, one hundred twenty-two million, one hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •