Base | Representation |
---|---|
bin | 1100000001000111100000… |
… | …0101100011100111001011 |
3 | 1201210011220222021221120111 |
4 | 3000101320011203213023 |
5 | 3212441402014000003 |
6 | 44034042155135151 |
7 | 2532426510631405 |
oct | 300217005434713 |
9 | 51704828257514 |
10 | 13213334125003 |
11 | 423481a708411 |
12 | 15949baa444b7 |
13 | 74b02066478c |
14 | 339758da9b75 |
15 | 17da9855ce6d |
hex | c04781639cb |
13213334125003 has 8 divisors (see below), whose sum is σ = 13670741066400. Its totient is φ = 12756045499008.
The previous prime is 13213334124997. The next prime is 13213334125073. The reversal of 13213334125003 is 30052143331231.
It is a happy number.
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 13213334125003 - 25 = 13213334124971 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13213334125073) 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 7 ways as a sum of consecutive naturals, for example, 29351598 + ... + 29798371.
It is an arithmetic number, because the mean of its divisors is an integer number (1708842633300).
Almost surely, 213213334125003 is an apocalyptic number.
13213334125003 is a deficient number, since it is larger than the sum of its proper divisors (457406941397).
13213334125003 is an equidigital number, since it uses as much as digits as its factorization.
13213334125003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59157701.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 13213334125003 its reverse (30052143331231), we get a palindrome (43265477456234).
The spelling of 13213334125003 in words is "thirteen trillion, two hundred thirteen billion, three hundred thirty-four million, one hundred twenty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •