Base | Representation |
---|---|
bin | 1100000001000011000001… |
… | …1100101010100010001001 |
3 | 1201210001211012201000010200 |
4 | 3000100300130222202021 |
5 | 3212431421322114423 |
6 | 44033323022202413 |
7 | 2532354644632305 |
oct | 300206034524211 |
9 | 51701735630120 |
10 | 13212132223113 |
11 | 423426322276a |
12 | 1594724423409 |
13 | 74ab8b655725 |
14 | 339683502d05 |
15 | 17da27c98d43 |
hex | c043072a889 |
13212132223113 has 24 divisors (see below), whose sum is σ = 19551080080896. Its totient is φ = 8592632107200.
The previous prime is 13212132223033. The next prime is 13212132223117. The reversal of 13212132223113 is 31132223121231.
13212132223113 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 21 + 322 + 2 + 311 + 3 = 666.
It is not a de Polignac number, because 13212132223113 - 213 = 13212132214921 is a prime.
It is a super-2 number, since 2×132121322231132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13212132223117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3809256 + ... + 6398022.
It is an arithmetic number, because the mean of its divisors is an integer number (814628336704).
Almost surely, 213212132223113 is an apocalyptic number.
It is an amenable number.
13212132223113 is a deficient number, since it is larger than the sum of its proper divisors (6338947857783).
13212132223113 is a wasteful number, since it uses less digits than its factorization.
13212132223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602645 (or 2602642 counting only the distinct ones).
The product of its digits is 2592, while the sum is 27.
Adding to 13212132223113 its reverse (31132223121231), we get a palindrome (44344355344344).
The spelling of 13212132223113 in words is "thirteen trillion, two hundred twelve billion, one hundred thirty-two million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •