Base | Representation |
---|---|
bin | 111011101001001… |
… | …1010001001110111 |
3 | 12011110211022021102 |
4 | 1313102122021313 |
5 | 13044314030143 |
6 | 530331040315 |
7 | 100410614633 |
oct | 16722321167 |
9 | 5143738242 |
10 | 2001314423 |
11 | 937765169 |
12 | 47a2a009b |
13 | 25b817724 |
14 | 14db1bdc3 |
15 | baa720b8 |
hex | 7749a277 |
2001314423 has 4 divisors (see below), whose sum is σ = 2055404040. Its totient is φ = 1947224808.
The previous prime is 2001314407. The next prime is 2001314429. The reversal of 2001314423 is 3244131002.
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 2001314423 - 24 = 2001314407 is a prime.
It is a super-3 number, since 3×20013144233 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001314395 and 2001314404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001314429) 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, 27044753 + ... + 27044826.
It is an arithmetic number, because the mean of its divisors is an integer number (513851010).
Almost surely, 22001314423 is an apocalyptic number.
2001314423 is a deficient number, since it is larger than the sum of its proper divisors (54089617).
2001314423 is an equidigital number, since it uses as much as digits as its factorization.
2001314423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54089616.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2001314423 is about 44736.0528321398. The cubic root of 2001314423 is about 1260.1970009853.
Adding to 2001314423 its reverse (3244131002), we get a palindrome (5245445425).
The spelling of 2001314423 in words is "two billion, one million, three hundred fourteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •