Base | Representation |
---|---|
bin | 11110100111110101001… |
… | …011010110111111001001 |
3 | 21110011200221022012020202 |
4 | 132213311023112333021 |
5 | 233434203203402101 |
6 | 4250420503101545 |
7 | 305014546204223 |
oct | 36476513267711 |
9 | 7404627265222 |
10 | 2104352403401 |
11 | 7414a6086a96 |
12 | 29ba074418b5 |
13 | 1235939b0631 |
14 | 73bcb999413 |
15 | 39b1439d36b |
hex | 1e9f52d6fc9 |
2104352403401 has 4 divisors (see below), whose sum is σ = 2117755922052. Its totient is φ = 2090948884752.
The previous prime is 2104352403389. The next prime is 2104352403421. The reversal of 2104352403401 is 1043042534012.
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 1033384068025 + 1070968335376 = 1016555^2 + 1034876^2 .
It is a cyclic number.
It is not a de Polignac number, because 2104352403401 - 230 = 2103278661577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2104352403421) 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, 6701759090 + ... + 6701759403.
It is an arithmetic number, because the mean of its divisors is an integer number (529438980513).
Almost surely, 22104352403401 is an apocalyptic number.
It is an amenable number.
2104352403401 is a deficient number, since it is larger than the sum of its proper divisors (13403518651).
2104352403401 is a wasteful number, since it uses less digits than its factorization.
2104352403401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13403518650.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 2104352403401 its reverse (1043042534012), we get a palindrome (3147394937413).
The spelling of 2104352403401 in words is "two trillion, one hundred four billion, three hundred fifty-two million, four hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •