Base | Representation |
---|---|
bin | 11010000101100010… |
… | …10011000110101101 |
3 | 1100011001002212212222 |
4 | 31002301103012231 |
5 | 212140302341303 |
6 | 10233414205125 |
7 | 1004026365611 |
oct | 150261230655 |
9 | 40131085788 |
10 | 14005121453 |
11 | 5a37587044 |
12 | 286a3537a5 |
13 | 14226b301b |
14 | 96c04b341 |
15 | 56e7e5938 |
hex | 342c531ad |
14005121453 has 4 divisors (see below), whose sum is σ = 14035501788. Its totient is φ = 13974741120.
The previous prime is 14005121447. The next prime is 14005121513. The reversal of 14005121453 is 35412150041.
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 3782496004 + 10222625449 = 61502^2 + 101107^2 .
It is a cyclic number.
It is not a de Polignac number, because 14005121453 - 226 = 13938012589 is a prime.
It is a super-2 number, since 2×140051214532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14005121443) 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, 15189476 + ... + 15190397.
It is an arithmetic number, because the mean of its divisors is an integer number (3508875447).
Almost surely, 214005121453 is an apocalyptic number.
It is an amenable number.
14005121453 is a deficient number, since it is larger than the sum of its proper divisors (30380335).
14005121453 is an equidigital number, since it uses as much as digits as its factorization.
14005121453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30380334.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 14005121453 its reverse (35412150041), we get a palindrome (49417271494).
The spelling of 14005121453 in words is "fourteen billion, five million, one hundred twenty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •