Base | Representation |
---|---|
bin | 10100011000111111111… |
… | …000001110001010110101 |
3 | 11221221211012102011112120 |
4 | 110120333320032022311 |
5 | 140424210121304310 |
6 | 2551414444110153 |
7 | 203143545221322 |
oct | 24307770161265 |
9 | 4857735364476 |
10 | 1401231041205 |
11 | 4a0293435816 |
12 | 1a7699535359 |
13 | a219b979218 |
14 | 4bb69cd9b49 |
15 | 266b127cb70 |
hex | 1463fe0e2b5 |
1401231041205 has 64 divisors (see below), whose sum is σ = 2382087502080. Its totient is φ = 700925423616.
The previous prime is 1401231041201. The next prime is 1401231041209. The reversal of 1401231041205 is 5021401321041.
It is an interprime number because it is at equal distance from previous prime (1401231041201) and next prime (1401231041209).
It is not a de Polignac number, because 1401231041205 - 22 = 1401231041201 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401231041201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 138197026 + ... + 138207164.
It is an arithmetic number, because the mean of its divisors is an integer number (37220117220).
Almost surely, 21401231041205 is an apocalyptic number.
1401231041205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1401231041205 is a deficient number, since it is larger than the sum of its proper divisors (980856460875).
1401231041205 is a wasteful number, since it uses less digits than its factorization.
1401231041205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11990.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1401231041205 its reverse (5021401321041), we get a palindrome (6422632362246).
The spelling of 1401231041205 in words is "one trillion, four hundred one billion, two hundred thirty-one million, forty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •