Base | Representation |
---|---|
bin | 1100000100110000100… |
… | …00001000100110110010 |
3 | 1110122212002101222001200 |
4 | 12002120100020212302 |
5 | 23244124013224202 |
6 | 514331134112030 |
7 | 41654616146244 |
oct | 6023020104662 |
9 | 1418762358050 |
10 | 414871226802 |
11 | 14aa44aa018a |
12 | 684a364b616 |
13 | 301785ab126 |
14 | 16119266094 |
15 | abd2272e1c |
hex | 60984089b2 |
414871226802 has 18 divisors (see below), whose sum is σ = 898893578973. Its totient is φ = 138289498032.
The previous prime is 414871226801. The next prime is 414871226807. The reversal of 414871226802 is 208622178414.
414871226802 is a `hidden beast` number, since 41 + 487 + 122 + 6 + 8 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 413578896201 + 1292330601 = 643101^2 + 35949^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=455451.
It is not an unprimeable number, because it can be changed into a prime (414871226801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2656798 + ... + 2808614.
Almost surely, 2414871226802 is an apocalyptic number.
414871226802 is an abundant number, since it is smaller than the sum of its proper divisors (484022352171).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414871226802 is an frugal number, since it uses more digits than its factorization.
414871226802 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303642 (or 151822 counting only the distinct ones).
The product of its (nonzero) digits is 344064, while the sum is 45.
The spelling of 414871226802 in words is "four hundred fourteen billion, eight hundred seventy-one million, two hundred twenty-six thousand, eight hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •