Base | Representation |
---|---|
bin | 1100000001110100010010… |
… | …0111101000001100011101 |
3 | 1201211022221202201021100010 |
4 | 3000131010213220030131 |
5 | 3213141012004341300 |
6 | 44043351111553433 |
7 | 2533333432202262 |
oct | 300350447501435 |
9 | 51738852637303 |
10 | 13225355543325 |
11 | 4239929468982 |
12 | 15971b498b879 |
13 | 74c1b8088163 |
14 | 33a1797a1269 |
15 | 17e04db0ea50 |
hex | c07449e831d |
13225355543325 has 48 divisors (see below), whose sum is σ = 22340666105856. Its totient is φ = 6900507288000.
The previous prime is 13225355543321. The next prime is 13225355543333. The reversal of 13225355543325 is 52334555352231.
It is a happy number.
It is not a de Polignac number, because 13225355543325 - 22 = 13225355543321 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13225355543321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7489344 + ... + 9085206.
It is an arithmetic number, because the mean of its divisors is an integer number (465430543872).
Almost surely, 213225355543325 is an apocalyptic number.
13225355543325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13225355543325 is a deficient number, since it is larger than the sum of its proper divisors (9115310562531).
13225355543325 is a wasteful number, since it uses less digits than its factorization.
13225355543325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1598274 (or 1598269 counting only the distinct ones).
The product of its digits is 8100000, while the sum is 48.
The spelling of 13225355543325 in words is "thirteen trillion, two hundred twenty-five billion, three hundred fifty-five million, five hundred forty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •