Base | Representation |
---|---|
bin | 1100110001001111100010… |
… | …0111000001001100100111 |
3 | 1211201020000101111111101201 |
4 | 3030103320213001030213 |
5 | 3320013133232221130 |
6 | 45505535521503331 |
7 | 2646236235524056 |
oct | 314237047011447 |
9 | 54636011444351 |
10 | 14040124101415 |
11 | 4523424036985 |
12 | 16a90a11a1b47 |
13 | 7aac939381a9 |
14 | 36778d30239d |
15 | 19533874abca |
hex | cc4f89c1327 |
14040124101415 has 8 divisors (see below), whose sum is σ = 16853568094080. Its totient is φ = 11228486499552.
The previous prime is 14040124101413. The next prime is 14040124101457. The reversal of 14040124101415 is 51410142104041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14040124101415 - 21 = 14040124101413 is a prime.
It is a super-2 number, since 2×140401241014152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14040124101413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451580599 + ... + 451611688.
It is an arithmetic number, because the mean of its divisors is an integer number (2106696011760).
Almost surely, 214040124101415 is an apocalyptic number.
14040124101415 is a deficient number, since it is larger than the sum of its proper divisors (2813443992665).
14040124101415 is an equidigital number, since it uses as much as digits as its factorization.
14040124101415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903195401.
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 14040124101415 its reverse (51410142104041), we get a palindrome (65450266205456).
The spelling of 14040124101415 in words is "fourteen trillion, forty billion, one hundred twenty-four million, one hundred one thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •