Base | Representation |
---|---|
bin | 1011111011111011111110… |
… | …1000000001111011111001 |
3 | 1201110200012211012120101011 |
4 | 2332332333220001323321 |
5 | 3210012122021444400 |
6 | 43525123310553521 |
7 | 2523126244415143 |
oct | 276767750017371 |
9 | 51420184176334 |
10 | 13124340031225 |
11 | 4200001884585 |
12 | 157b702b088a1 |
13 | 74280a069aa7 |
14 | 335315915c93 |
15 | 17b5da67c8ba |
hex | befbfa01ef9 |
13124340031225 has 12 divisors (see below), whose sum is σ = 16280914929084. Its totient is φ = 10495127966720.
The previous prime is 13124340031219. The next prime is 13124340031241. The reversal of 13124340031225 is 52213004342131.
It can be written as a sum of positive squares in 6 ways, for example, as 602784537664 + 12521555493561 = 776392^2 + 3538581^2 .
It is not a de Polignac number, because 13124340031225 - 29 = 13124340030713 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108539824 + ... + 108660673.
It is an arithmetic number, because the mean of its divisors is an integer number (1356742910757).
Almost surely, 213124340031225 is an apocalyptic number.
It is an amenable number.
13124340031225 is a deficient number, since it is larger than the sum of its proper divisors (3156574897859).
13124340031225 is a wasteful number, since it uses less digits than its factorization.
13124340031225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217202924 (or 217202919 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 13124340031225 its reverse (52213004342131), we get a palindrome (65337344373356).
The spelling of 13124340031225 in words is "thirteen trillion, one hundred twenty-four billion, three hundred forty million, thirty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •