Base | Representation |
---|---|
bin | 110000110101001111000000… |
… | …110011101001101011010100 |
3 | 1001011102021200011221202121201 |
4 | 300311033000303221223110 |
5 | 211122200131010424122 |
6 | 2040433235255522244 |
7 | 63144136063515415 |
oct | 6065170063515324 |
9 | 1034367604852551 |
10 | 214764484467412 |
11 | 62481119646400 |
12 | 20106967389384 |
13 | 92ab286205849 |
14 | 3b0692967180c |
15 | 19c67b5318a27 |
hex | c353c0ce9ad4 |
214764484467412 has 36 divisors (see below), whose sum is σ = 413133321016948. Its totient is φ = 97614951033600.
The previous prime is 214764484467391. The next prime is 214764484467469.
214764484467412 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 147603935383696 + 67160549083716 = 12149236^2 + 8195154^2 .
It is a super-2 number, since 2×2147644844674122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2992293 + ... + 20939980.
Almost surely, 2214764484467412 is an apocalyptic number.
214764484467412 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
214764484467412 is a deficient number, since it is larger than the sum of its proper divisors (198368836549536).
214764484467412 is a wasteful number, since it uses less digits than its factorization.
214764484467412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23950840 (or 23950827 counting only the distinct ones).
The product of its digits is 231211008, while the sum is 64.
The spelling of 214764484467412 in words is "two hundred fourteen trillion, seven hundred sixty-four billion, four hundred eighty-four million, four hundred sixty-seven thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •