Base | Representation |
---|---|
bin | 10100011000110100101… |
… | …010111001101011010101 |
3 | 11221221100002120200112021 |
4 | 110120310222321223111 |
5 | 140423314002000041 |
6 | 2551344045453141 |
7 | 203136103002310 |
oct | 24306452715325 |
9 | 4857302520467 |
10 | 1401043000021 |
11 | 4a01a7280685 |
12 | 1a76465711b1 |
13 | a216ba1b252 |
14 | 4bb4cd4b977 |
15 | 2669e9d6cd1 |
hex | 14634ab9ad5 |
1401043000021 has 16 divisors (see below), whose sum is σ = 1607726361600. Its totient is φ = 1196003128320.
The previous prime is 1401043000009. The next prime is 1401043000033. The reversal of 1401043000021 is 1200003401041.
It is an interprime number because it is at equal distance from previous prime (1401043000009) and next prime (1401043000033).
It is not a de Polignac number, because 1401043000021 - 27 = 1401042999893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1401042999959 and 1401043000004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401043009021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1288380 + ... + 2112346.
It is an arithmetic number, because the mean of its divisors is an integer number (100482897600).
Almost surely, 21401043000021 is an apocalyptic number.
It is an amenable number.
1401043000021 is a deficient number, since it is larger than the sum of its proper divisors (206683361579).
1401043000021 is an equidigital number, since it uses as much as digits as its factorization.
1401043000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824964.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1401043000021 its reverse (1200003401041), we get a palindrome (2601046401062).
The spelling of 1401043000021 in words is "one trillion, four hundred one billion, forty-three million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •