Base | Representation |
---|---|
bin | 1011111011001111001000… |
… | …1011101000010000001001 |
3 | 1201102112010222000101121021 |
4 | 2332303302023220100021 |
5 | 3204312444122301441 |
6 | 43515413050312441 |
7 | 2522222046160603 |
oct | 276636213502011 |
9 | 51375128011537 |
10 | 13112303322121 |
11 | 41a599542a903 |
12 | 1579303a28721 |
13 | 74163c421603 |
14 | 3348d30a0173 |
15 | 17b133aaa3d1 |
hex | becf22e8409 |
13112303322121 has 8 divisors (see below), whose sum is σ = 13159229794560. Its totient is φ = 13065429372528.
The previous prime is 13112303322119. The next prime is 13112303322137. The reversal of 13112303322121 is 12122330321131.
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 13112303322121 - 21 = 13112303322119 is a prime.
It is a super-2 number, since 2×131123033221212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13112303322421) 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, 12630486 + ... + 13629151.
It is an arithmetic number, because the mean of its divisors is an integer number (1644903724320).
Almost surely, 213112303322121 is an apocalyptic number.
It is an amenable number.
13112303322121 is a deficient number, since it is larger than the sum of its proper divisors (46926472439).
13112303322121 is a wasteful number, since it uses less digits than its factorization.
13112303322121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26261423.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13112303322121 its reverse (12122330321131), we get a palindrome (25234633643252).
The spelling of 13112303322121 in words is "thirteen trillion, one hundred twelve billion, three hundred three million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •