Base | Representation |
---|---|
bin | 1100000011011100110010… |
… | …0000101100111110010011 |
3 | 1201221000100121011010222002 |
4 | 3000313030200230332103 |
5 | 3214120433214424133 |
6 | 44104310314104215 |
7 | 2535345510502313 |
oct | 300671440547623 |
9 | 51830317133862 |
10 | 13253405233043 |
11 | 424a812813a28 |
12 | 15a072271b06b |
13 | 751a38382cb1 |
14 | 33b67aba7443 |
15 | 17eb413ddce8 |
hex | c0dcc82cf93 |
13253405233043 has 8 divisors (see below), whose sum is σ = 13488018264000. Its totient is φ = 13020576332008.
The previous prime is 13253405233031. The next prime is 13253405233073. The reversal of 13253405233043 is 34033250435231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13253405233043 - 28 = 13253405232787 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13253405232988 and 13253405233006.
It is not an unprimeable number, because it can be changed into a prime (13253405233073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 446017493 + ... + 446047206.
It is an arithmetic number, because the mean of its divisors is an integer number (1686002283000).
Almost surely, 213253405233043 is an apocalyptic number.
13253405233043 is a deficient number, since it is larger than the sum of its proper divisors (234613030957).
13253405233043 is an equidigital number, since it uses as much as digits as its factorization.
13253405233043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892064961.
The product of its (nonzero) digits is 388800, while the sum is 38.
Adding to 13253405233043 its reverse (34033250435231), we get a palindrome (47286655668274).
The spelling of 13253405233043 in words is "thirteen trillion, two hundred fifty-three billion, four hundred five million, two hundred thirty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •