Base | Representation |
---|---|
bin | 1100001101110010100111… |
… | …0000001110100100010001 |
3 | 1202112222220220001010212201 |
4 | 3003130221300032210101 |
5 | 3230023304142234100 |
6 | 44322051213523201 |
7 | 2554235160614221 |
oct | 303345160164421 |
9 | 52488826033781 |
10 | 13431063243025 |
11 | 430909a06536a |
12 | 160b043aa3501 |
13 | 76570ba3cb1c |
14 | 3460d1924081 |
15 | 18458d1ce36a |
hex | c3729c0e911 |
13431063243025 has 12 divisors (see below), whose sum is σ = 16656909123712. Its totient is φ = 10743308205840.
The previous prime is 13431063243023. The next prime is 13431063243061. The reversal of 13431063243025 is 52034236013431.
It is a happy number.
It is not a de Polignac number, because 13431063243025 - 21 = 13431063243023 is a prime.
It is a super-2 number, since 2×134310632430252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13431063243023) 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 11 ways as a sum of consecutive naturals, for example, 38382057 + ... + 38730406.
Almost surely, 213431063243025 is an apocalyptic number.
It is an amenable number.
13431063243025 is a deficient number, since it is larger than the sum of its proper divisors (3225845880687).
13431063243025 is an equidigital number, since it uses as much as digits as its factorization.
13431063243025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77119440 (or 77119435 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 13431063243025 its reverse (52034236013431), we get a palindrome (65465299256456).
The spelling of 13431063243025 in words is "thirteen trillion, four hundred thirty-one billion, sixty-three million, two hundred forty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •