Base | Representation |
---|---|
bin | 1100000010101011000010… |
… | …0000111010011000101010 |
3 | 1201212201212220002201101220 |
4 | 3000222300200322120222 |
5 | 3213411110424432132 |
6 | 44054221214322510 |
7 | 2534363540263224 |
oct | 300526040723052 |
9 | 51781786081356 |
10 | 13240050624042 |
11 | 424508a456590 |
12 | 159a0161b9436 |
13 | 7506ba6a32a8 |
14 | 33ab712d1414 |
15 | 17e60dc92a2c |
hex | c0ab083a62a |
13240050624042 has 32 divisors (see below), whose sum is σ = 28892358595584. Its totient is φ = 4011445522800.
The previous prime is 13240050624013. The next prime is 13240050624043. The reversal of 13240050624042 is 24042605004231.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 13240050623994 and 13240050624012.
It is not an unprimeable number, because it can be changed into a prime (13240050624043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16889584 + ... + 17656107.
It is an arithmetic number, because the mean of its divisors is an integer number (902886206112).
Almost surely, 213240050624042 is an apocalyptic number.
13240050624042 is an abundant number, since it is smaller than the sum of its proper divisors (15652307971542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13240050624042 is a wasteful number, since it uses less digits than its factorization.
13240050624042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34551514.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 13240050624042 its reverse (24042605004231), we get a palindrome (37282655628273).
The spelling of 13240050624042 in words is "thirteen trillion, two hundred forty billion, fifty million, six hundred twenty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •