Base | Representation |
---|---|
bin | 11010011100111010… |
… | …11001001011000111 |
3 | 1100122201010020021100 |
4 | 31032131121023013 |
5 | 213041003330043 |
6 | 10305101351143 |
7 | 1011630314661 |
oct | 151635311307 |
9 | 40581106240 |
10 | 14201230023 |
11 | 6028251342 |
12 | 2903b684b3 |
13 | 1454206cb6 |
14 | 98a0d9531 |
15 | 581b31cd3 |
hex | 34e7592c7 |
14201230023 has 12 divisors (see below), whose sum is σ = 21220229160. Its totient is φ = 9141021456.
The previous prime is 14201230013. The next prime is 14201230027. The reversal of 14201230023 is 32003210241.
It is not a de Polignac number, because 14201230023 - 214 = 14201213639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14201229978 and 14201230005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14201230027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27205161 + ... + 27205682.
It is an arithmetic number, because the mean of its divisors is an integer number (1768352430).
Almost surely, 214201230023 is an apocalyptic number.
14201230023 is a deficient number, since it is larger than the sum of its proper divisors (7018999137).
14201230023 is a wasteful number, since it uses less digits than its factorization.
14201230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54410878 (or 54410875 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 14201230023 its reverse (32003210241), we get a palindrome (46204440264).
It can be divided in two parts, 14201 and 230023, that multiplied together give a palindrome (3266556623).
The spelling of 14201230023 in words is "fourteen billion, two hundred one million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •