Base | Representation |
---|---|
bin | 10001101010110001000… |
… | …111000101110010011111 |
3 | 11022001221100120112101210 |
4 | 101222301013011302133 |
5 | 124343040431002143 |
6 | 2325435051235503 |
7 | 153501552306225 |
oct | 21526107056237 |
9 | 4261840515353 |
10 | 1214152203423 |
11 | 428a122a1a85 |
12 | 177389148b93 |
13 | 8a6565b7683 |
14 | 42a9dd00b15 |
15 | 218b2386033 |
hex | 11ab11c5c9f |
1214152203423 has 4 divisors (see below), whose sum is σ = 1618869604568. Its totient is φ = 809434802280.
The previous prime is 1214152203409. The next prime is 1214152203437. The reversal of 1214152203423 is 3243022514121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1214152203409) and next prime (1214152203437).
It is not a de Polignac number, because 1214152203423 - 213 = 1214152195231 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 (1214152203403) 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, 202358700568 + ... + 202358700573.
It is an arithmetic number, because the mean of its divisors is an integer number (404717401142).
Almost surely, 21214152203423 is an apocalyptic number.
1214152203423 is a deficient number, since it is larger than the sum of its proper divisors (404717401145).
1214152203423 is an equidigital number, since it uses as much as digits as its factorization.
1214152203423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404717401144.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 1214152203423 its reverse (3243022514121), we get a palindrome (4457174717544).
The spelling of 1214152203423 in words is "one trillion, two hundred fourteen billion, one hundred fifty-two million, two hundred three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •