Base | Representation |
---|---|
bin | 1100000111010101101001… |
… | …1100111100110000011111 |
3 | 1202011101210102012222220021 |
4 | 3001311122130330300133 |
5 | 3221214243021420411 |
6 | 44155115344133011 |
7 | 2543232151263415 |
oct | 301653234746037 |
9 | 52141712188807 |
10 | 13320211123231 |
11 | 4276084a16021 |
12 | 15b1667907167 |
13 | 758123b41b2c |
14 | 3409b74c92b5 |
15 | 1817513b6a71 |
hex | c1d5a73cc1f |
13320211123231 has 6 divisors (see below), whose sum is σ = 13795367287832. Its totient is φ = 12860893497480.
The previous prime is 13320211123223. The next prime is 13320211123253. The reversal of 13320211123231 is 13232111202331.
It is not a de Polignac number, because 13320211123231 - 23 = 13320211123223 is a prime.
It is a super-2 number, since 2×133202111232312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13320211123196 and 13320211123205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320211127231) 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, 7919268555 + ... + 7919270236.
Almost surely, 213320211123231 is an apocalyptic number.
13320211123231 is a deficient number, since it is larger than the sum of its proper divisors (475156164601).
13320211123231 is an equidigital number, since it uses as much as digits as its factorization.
13320211123231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15838538849 (or 15838538820 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13320211123231 its reverse (13232111202331), we get a palindrome (26552322325562).
The spelling of 13320211123231 in words is "thirteen trillion, three hundred twenty billion, two hundred eleven million, one hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •