Base | Representation |
---|---|
bin | 1100000001000011010111… |
… | …1111001000101010110011 |
3 | 1201210002001200112221201102 |
4 | 3000100311333020222303 |
5 | 3212432114114124043 |
6 | 44033340141555015 |
7 | 2532360153516155 |
oct | 300206577105263 |
9 | 51702050487642 |
10 | 13212225145523 |
11 | 423430071a748 |
12 | 159474b575a6b |
13 | 74aba498b8c1 |
14 | 3396919b0ad5 |
15 | 17da310016b8 |
hex | c0435fc8ab3 |
13212225145523 has 8 divisors (see below), whose sum is σ = 14203511915520. Its totient is φ = 12250529025480.
The previous prime is 13212225145487. The next prime is 13212225145579. The reversal of 13212225145523 is 32554152221231.
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 13212225145523 - 232 = 13207930178227 is a prime.
It is a super-5 number, since 5×132122251455235 (a number of 67 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13212225345523) 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, 7397661563 + ... + 7397663348.
It is an arithmetic number, because the mean of its divisors is an integer number (1775438989440).
Almost surely, 213212225145523 is an apocalyptic number.
13212225145523 is a deficient number, since it is larger than the sum of its proper divisors (991286769997).
13212225145523 is a wasteful number, since it uses less digits than its factorization.
13212225145523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14795324977.
The product of its digits is 144000, while the sum is 38.
Adding to 13212225145523 its reverse (32554152221231), we get a palindrome (45766377366754).
The spelling of 13212225145523 in words is "thirteen trillion, two hundred twelve billion, two hundred twenty-five million, one hundred forty-five thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •