Base | Representation |
---|---|
bin | 1100000010100010110… |
… | …00101001101000101001 |
3 | 1110112210020012001102022 |
4 | 12001101120221220221 |
5 | 23234210130330110 |
6 | 514013142514225 |
7 | 41613301223102 |
oct | 6012130515051 |
9 | 1415706161368 |
10 | 413682276905 |
11 | 14a494951567 |
12 | 68211435975 |
13 | 30019185491 |
14 | 160453b13a9 |
15 | ab62bbb755 |
hex | 6051629a29 |
413682276905 has 8 divisors (see below), whose sum is σ = 498350324232. Its totient is φ = 329658093568.
The previous prime is 413682276899. The next prime is 413682276937. The reversal of 413682276905 is 509672286314.
It can be written as a sum of positive squares in 4 ways, for example, as 196171039744 + 217511237161 = 442912^2 + 466381^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 413682276905 - 26 = 413682276841 is a prime.
It is a super-2 number, since 2×4136822769052 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160964582 + ... + 160967151.
It is an arithmetic number, because the mean of its divisors is an integer number (62293790529).
It is a 1-persistent number, because it is pandigital, but 2⋅413682276905 = 827364553810 is not.
Almost surely, 2413682276905 is an apocalyptic number.
It is an amenable number.
413682276905 is a deficient number, since it is larger than the sum of its proper divisors (84668047327).
413682276905 is a wasteful number, since it uses less digits than its factorization.
413682276905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321931995.
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 413682276905 in words is "four hundred thirteen billion, six hundred eighty-two million, two hundred seventy-six thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •