Base | Representation |
---|---|
bin | 1100000000100001000001… |
… | …0111011011000010001001 |
3 | 1201202012021001102102121121 |
4 | 3000020100113123002021 |
5 | 3212304223013342101 |
6 | 44025213141435241 |
7 | 2531612514451414 |
oct | 300102027330211 |
9 | 51665231372547 |
10 | 13203004043401 |
11 | 42303a9643197 |
12 | 15929b740bb21 |
13 | 74a065476363 |
14 | 339059082b7b |
15 | 17d6916ed0a1 |
hex | c02105db089 |
13203004043401 has 4 divisors (see below), whose sum is σ = 13203213435412. Its totient is φ = 13202794651392.
The previous prime is 13203004043353. The next prime is 13203004043461. The reversal of 13203004043401 is 10434040030231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6539501990025 + 6663502053376 = 2557245^2 + 2581376^2 .
It is a cyclic number.
It is not a de Polignac number, because 13203004043401 - 215 = 13203004010633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13203004043461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104601396 + ... + 104727541.
It is an arithmetic number, because the mean of its divisors is an integer number (3300803358853).
Almost surely, 213203004043401 is an apocalyptic number.
It is an amenable number.
13203004043401 is a deficient number, since it is larger than the sum of its proper divisors (209392011).
13203004043401 is an equidigital number, since it uses as much as digits as its factorization.
13203004043401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209392010.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 13203004043401 its reverse (10434040030231), we get a palindrome (23637044073632).
The spelling of 13203004043401 in words is "thirteen trillion, two hundred three billion, four million, forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •