Base | Representation |
---|---|
bin | 1100000011011011101110… |
… | …0101110001101001100101 |
3 | 1201220222121210222101222101 |
4 | 3000312323211301221211 |
5 | 3214114343031201440 |
6 | 44104222213332101 |
7 | 2535335462520550 |
oct | 300667345615145 |
9 | 51828553871871 |
10 | 13253121350245 |
11 | 424a687548647 |
12 | 15a0663637031 |
13 | 7519c16091ca |
14 | 33b6511cb697 |
15 | 17eb2651569a |
hex | c0dbb971a65 |
13253121350245 has 16 divisors (see below), whose sum is σ = 18187643502720. Its totient is φ = 9081887529024.
The previous prime is 13253121350237. The next prime is 13253121350303. The reversal of 13253121350245 is 54205312135231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13253121350245 - 23 = 13253121350237 is a prime.
It is a super-4 number, since 4×132531213502454 (a number of 54 digits) contains 4444 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 124260750 + ... + 124367359.
It is an arithmetic number, because the mean of its divisors is an integer number (1136727718920).
Almost surely, 213253121350245 is an apocalyptic number.
It is an amenable number.
13253121350245 is a deficient number, since it is larger than the sum of its proper divisors (4934522152475).
13253121350245 is a wasteful number, since it uses less digits than its factorization.
13253121350245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248629644.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 13253121350245 its reverse (54205312135231), we get a palindrome (67458433485476).
The spelling of 13253121350245 in words is "thirteen trillion, two hundred fifty-three billion, one hundred twenty-one million, three hundred fifty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •