Base | Representation |
---|---|
bin | 1100001101011100011111… |
… | …0100011100010000100111 |
3 | 1202112102121001120222100000 |
4 | 3003113013310130100213 |
5 | 3224424124023310343 |
6 | 44315230053152343 |
7 | 2553635055320043 |
oct | 303270764342047 |
9 | 52472531528300 |
10 | 13425125213223 |
11 | 4306622210719 |
12 | 1609a6732b6b3 |
13 | 764ca3760a19 |
14 | 345acb047023 |
15 | 184341c37ed3 |
hex | c35c7d1c427 |
13425125213223 has 48 divisors (see below), whose sum is σ = 21133895758976. Its totient is φ = 8505673051680.
The previous prime is 13425125213207. The next prime is 13425125213231. The reversal of 13425125213223 is 32231252152431.
13425125213223 is a `hidden beast` number, since 1 + 3 + 4 + 2 + 512 + 5 + 2 + 132 + 2 + 3 = 666.
13425125213223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13425125213223 - 24 = 13425125213207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13425125213243) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16975873 + ... + 17749098.
Almost surely, 213425125213223 is an apocalyptic number.
13425125213223 is a deficient number, since it is larger than the sum of its proper divisors (7708770545753).
13425125213223 is an equidigital number, since it uses as much as digits as its factorization.
13425125213223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34725066 (or 34725054 counting only the distinct ones).
The product of its digits is 86400, while the sum is 36.
Adding to 13425125213223 its reverse (32231252152431), we get a palindrome (45656377365654).
The spelling of 13425125213223 in words is "thirteen trillion, four hundred twenty-five billion, one hundred twenty-five million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •