Base | Representation |
---|---|
bin | 1100110000101010110001… |
… | …0101100010000011101111 |
3 | 1211200021112120010112021110 |
4 | 3030022230111202003233 |
5 | 3314332430123430130 |
6 | 45501224314203103 |
7 | 2645436533442666 |
oct | 314125425420357 |
9 | 54607476115243 |
10 | 14030254514415 |
11 | 451a2199a6107 |
12 | 16a71a7a23493 |
13 | 7aa07cc7c499 |
14 | 3670d4609ddd |
15 | 194e5c04dab0 |
hex | cc2ac5620ef |
14030254514415 has 8 divisors (see below), whose sum is σ = 22448407223088. Its totient is φ = 7482802407680.
The previous prime is 14030254514329. The next prime is 14030254514417. The reversal of 14030254514415 is 51441545203041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14030254514415 - 29 = 14030254513903 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14030254514417) 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, 467675150466 + ... + 467675150495.
It is an arithmetic number, because the mean of its divisors is an integer number (2806050902886).
Almost surely, 214030254514415 is an apocalyptic number.
14030254514415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14030254514415 is a deficient number, since it is larger than the sum of its proper divisors (8418152708673).
14030254514415 is an equidigital number, since it uses as much as digits as its factorization.
14030254514415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935350300969.
The product of its (nonzero) digits is 192000, while the sum is 39.
Adding to 14030254514415 its reverse (51441545203041), we get a palindrome (65471799717456).
The spelling of 14030254514415 in words is "fourteen trillion, thirty billion, two hundred fifty-four million, five hundred fourteen thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •