Base | Representation |
---|---|
bin | 1100000001101110111… |
… | …10111001101000001101 |
3 | 1110111122221110122111010 |
4 | 12000313132321220031 |
5 | 23232312403121121 |
6 | 513502100315433 |
7 | 41566443362265 |
oct | 6006736715015 |
9 | 1414587418433 |
10 | 413247707661 |
11 | 14a291615228 |
12 | 6810b9a2b79 |
13 | 2cc7a12c209 |
14 | 160037ac7a5 |
15 | ab3997a376 |
hex | 60377b9a0d |
413247707661 has 8 divisors (see below), whose sum is σ = 551163270400. Its totient is φ = 275415308352.
The previous prime is 413247707617. The next prime is 413247707671. The reversal of 413247707661 is 166707742314.
413247707661 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413247707661 - 221 = 413245610509 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 413247707661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413247707671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20779261 + ... + 20799138.
It is an arithmetic number, because the mean of its divisors is an integer number (68895408800).
Almost surely, 2413247707661 is an apocalyptic number.
It is an amenable number.
413247707661 is a deficient number, since it is larger than the sum of its proper divisors (137915562739).
413247707661 is a wasteful number, since it uses less digits than its factorization.
413247707661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41581715.
The product of its (nonzero) digits is 1185408, while the sum is 48.
The spelling of 413247707661 in words is "four hundred thirteen billion, two hundred forty-seven million, seven hundred seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •