Base | Representation |
---|---|
bin | 10100101010101011010… |
… | …111010101101111111101 |
3 | 12000202211011122002001112 |
4 | 110222223113111233331 |
5 | 141232044320330023 |
6 | 3004234251451405 |
7 | 204415142526155 |
oct | 24525327255775 |
9 | 5022734562045 |
10 | 1420214230013 |
11 | 4a83449a9507 |
12 | 1ab2b6a56b65 |
13 | a3c057abb17 |
14 | 4ca4b139765 |
15 | 26e22ae6478 |
hex | 14aab5d5bfd |
1420214230013 has 4 divisors (see below), whose sum is σ = 1424428515900. Its totient is φ = 1415999944128.
The previous prime is 1420214229997. The next prime is 1420214230033. The reversal of 1420214230013 is 3100324120241.
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 337005792484 + 1083208437529 = 580522^2 + 1040773^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420214230013 - 24 = 1420214229997 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 (1420214230033) 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, 2107142438 + ... + 2107143111.
It is an arithmetic number, because the mean of its divisors is an integer number (356107128975).
Almost surely, 21420214230013 is an apocalyptic number.
It is an amenable number.
1420214230013 is a deficient number, since it is larger than the sum of its proper divisors (4214285887).
1420214230013 is an equidigital number, since it uses as much as digits as its factorization.
1420214230013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4214285886.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1420214230013 its reverse (3100324120241), we get a palindrome (4520538350254).
The spelling of 1420214230013 in words is "one trillion, four hundred twenty billion, two hundred fourteen million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •