Base | Representation |
---|---|
bin | 10100100111001010101… |
… | …011000001000000011011 |
3 | 12000102002110020200022012 |
4 | 110213022223001000123 |
5 | 141201334243424311 |
6 | 3002412225420135 |
7 | 204222546501350 |
oct | 24471253010033 |
9 | 5012073220265 |
10 | 1416444514331 |
11 | 4a6790002300 |
12 | 1aa62449a64b |
13 | a37547b8c22 |
14 | 4c7b060c627 |
15 | 26ca1bad78b |
hex | 149caac101b |
1416444514331 has 24 divisors (see below), whose sum is σ = 1779473912832. Its totient is φ = 1103636991600.
The previous prime is 1416444514237. The next prime is 1416444514351. The reversal of 1416444514331 is 1334154446141.
It is not a de Polignac number, because 1416444514331 - 210 = 1416444513307 is a prime.
It is a super-2 number, since 2×14164445143312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1416444514351) 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 23 ways as a sum of consecutive naturals, for example, 12165116 + ... + 12280998.
It is an arithmetic number, because the mean of its divisors is an integer number (74144746368).
Almost surely, 21416444514331 is an apocalyptic number.
1416444514331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1416444514331 is a deficient number, since it is larger than the sum of its proper divisors (363029398501).
1416444514331 is a wasteful number, since it uses less digits than its factorization.
1416444514331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130343 (or 130332 counting only the distinct ones).
The product of its digits is 276480, while the sum is 41.
The spelling of 1416444514331 in words is "one trillion, four hundred sixteen billion, four hundred forty-four million, five hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •