Base | Representation |
---|---|
bin | 1011101110010100111… |
… | …0100110000111100111 |
3 | 201020212220112210011121 |
4 | 2323211032212013213 |
5 | 11244444030213411 |
6 | 232310051314411 |
7 | 20360143223650 |
oct | 2734516460747 |
9 | 636786483147 |
10 | 201414304231 |
11 | 7846813a978 |
12 | 330512aba07 |
13 | 15cbb33869a |
14 | 9a69c78527 |
15 | 538c6e2571 |
hex | 2ee53a61e7 |
201414304231 has 4 divisors (see below), whose sum is σ = 230187776272. Its totient is φ = 172640832192.
The previous prime is 201414304171. The next prime is 201414304271. The reversal of 201414304231 is 132403414102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201414304231 - 27 = 201414304103 is a prime.
It is a super-2 number, since 2×2014143042312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201414304196 and 201414304205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201414304271) 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, 14386736010 + ... + 14386736023.
It is an arithmetic number, because the mean of its divisors is an integer number (57546944068).
Almost surely, 2201414304231 is an apocalyptic number.
201414304231 is a deficient number, since it is larger than the sum of its proper divisors (28773472041).
201414304231 is an equidigital number, since it uses as much as digits as its factorization.
201414304231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28773472040.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 201414304231 its reverse (132403414102), we get a palindrome (333817718333).
The spelling of 201414304231 in words is "two hundred one billion, four hundred fourteen million, three hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •