Base | Representation |
---|---|
bin | 1101000111011000101000… |
… | …0111000010101000010000 |
3 | 1220001120212222211220110112 |
4 | 3101312022013002220100 |
5 | 3342231212203024011 |
6 | 50400410235420452 |
7 | 3015563662140422 |
oct | 321661207025020 |
9 | 56046788756415 |
10 | 14420522314256 |
11 | 465a7889a4483 |
12 | 174a9638b4728 |
13 | 807b072358b6 |
14 | 37bd5803a812 |
15 | 1a019e33758b |
hex | d1d8a1c2a10 |
14420522314256 has 20 divisors (see below), whose sum is σ = 28216393293804. Its totient is φ = 7138872432000.
The previous prime is 14420522314243. The next prime is 14420522314259. The reversal of 14420522314256 is 65241322502441.
It can be written as a sum of positive squares in 2 ways, for example, as 12113768874256 + 2306753440000 = 3480484^2 + 1518800^2 .
It is not an unprimeable number, because it can be changed into a prime (14420522314259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4461793655 + ... + 4461796886.
Almost surely, 214420522314256 is an apocalyptic number.
14420522314256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
14420522314256 is a deficient number, since it is larger than the sum of its proper divisors (13795870979548).
14420522314256 is a wasteful number, since it uses less digits than its factorization.
14420522314256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8923590650 (or 8923590644 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 41.
Adding to 14420522314256 its reverse (65241322502441), we get a palindrome (79661844816697).
The spelling of 14420522314256 in words is "fourteen trillion, four hundred twenty billion, five hundred twenty-two million, three hundred fourteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •