Base | Representation |
---|---|
bin | 10100011011100110001… |
… | …011011111010100000101 |
3 | 11222020000122102100102122 |
4 | 110123212023133110011 |
5 | 141000413401010041 |
6 | 2552555353015325 |
7 | 203302644344615 |
oct | 24334613372405 |
9 | 4866018370378 |
10 | 1404021110021 |
11 | 4a149534a812 |
12 | 1a81379b4545 |
13 | a2524a0a00a |
14 | 4bd52696a45 |
15 | 267c61a4c4b |
hex | 146e62df505 |
1404021110021 has 4 divisors (see below), whose sum is σ = 1404027389100. Its totient is φ = 1404014830944.
The previous prime is 1404021110017. The next prime is 1404021110027. The reversal of 1404021110021 is 1200111204041.
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 104788164100 + 1299232945921 = 323710^2 + 1139839^2 .
It is a cyclic number.
It is not a de Polignac number, because 1404021110021 - 22 = 1404021110017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404021110027) 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, 2791256 + ... + 3255633.
It is an arithmetic number, because the mean of its divisors is an integer number (351006847275).
Almost surely, 21404021110021 is an apocalyptic number.
It is an amenable number.
1404021110021 is a deficient number, since it is larger than the sum of its proper divisors (6279079).
1404021110021 is an equidigital number, since it uses as much as digits as its factorization.
1404021110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6279078.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1404021110021 its reverse (1200111204041), we get a palindrome (2604132314062).
The spelling of 1404021110021 in words is "one trillion, four hundred four billion, twenty-one million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •