Base | Representation |
---|---|
bin | 10100100101001000100… |
… | …111110001100001011110 |
3 | 12000012110101122021202000 |
4 | 110211020213301201132 |
5 | 141132402213021043 |
6 | 3001411524143130 |
7 | 204114513656136 |
oct | 24451047614136 |
9 | 5005411567660 |
10 | 1414262626398 |
11 | 4a5870423636 |
12 | 1aa115837aa6 |
13 | a349775958b |
14 | 4c644927ac6 |
15 | 26bc536d2d3 |
hex | 149489f185e |
1414262626398 has 32 divisors (see below), whose sum is σ = 3182588198400. Its totient is φ = 465453521208.
The previous prime is 1414262626307. The next prime is 1414262626487. The reversal of 1414262626398 is 8936262624141.
1414262626398 is a `hidden beast` number, since 1 + 4 + 1 + 4 + 2 + 6 + 2 + 626 + 3 + 9 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 165755536 + ... + 165764067.
It is an arithmetic number, because the mean of its divisors is an integer number (99455881200).
Almost surely, 21414262626398 is an apocalyptic number.
1414262626398 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
1414262626398 is an abundant number, since it is smaller than the sum of its proper divisors (1768325572002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414262626398 is a wasteful number, since it uses less digits than its factorization.
1414262626398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331519693 (or 331519687 counting only the distinct ones).
The product of its digits is 5971968, while the sum is 54.
The spelling of 1414262626398 in words is "one trillion, four hundred fourteen billion, two hundred sixty-two million, six hundred twenty-six thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.274 sec. • engine limits •