Base | Representation |
---|---|
bin | 1100000000111111010011… |
… | …1000111011110110100011 |
3 | 1201202222020120111021020211 |
4 | 3000033310320323312203 |
5 | 3212422400022013443 |
6 | 44033035525314551 |
7 | 2532321122451541 |
oct | 300176470736643 |
9 | 51688216437224 |
10 | 13211133001123 |
11 | 42338a0190472 |
12 | 15944a5865a57 |
13 | 74aa5c62b705 |
14 | 3395ca918d91 |
15 | 17d9ba1bd19d |
hex | c03f4e3bda3 |
13211133001123 has 16 divisors (see below), whose sum is σ = 13773273999264. Its totient is φ = 12659857562880.
The previous prime is 13211133001117. The next prime is 13211133001153. The reversal of 13211133001123 is 32110033111231.
It is a cyclic number.
It is not a de Polignac number, because 13211133001123 - 25 = 13211133001091 is a prime.
It is a super-2 number, since 2×132111330011232 (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 = 13211133001094 and 13211133001103.
It is not an unprimeable number, because it can be changed into a prime (13211133001153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12844311 + ... + 13834687.
It is an arithmetic number, because the mean of its divisors is an integer number (860829624954).
Almost surely, 213211133001123 is an apocalyptic number.
13211133001123 is a deficient number, since it is larger than the sum of its proper divisors (562140998141).
13211133001123 is an equidigital number, since it uses as much as digits as its factorization.
13211133001123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 995862.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13211133001123 its reverse (32110033111231), we get a palindrome (45321166112354).
The spelling of 13211133001123 in words is "thirteen trillion, two hundred eleven billion, one hundred thirty-three million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •