Base | Representation |
---|---|
bin | 101110111101111010110011… |
… | …0000010101111100111110010 |
3 | 2000011202212120102011002012110 |
4 | 1131323311212002233213302 |
5 | 413122211344213332242 |
6 | 4022353241031510150 |
7 | 153006452326612653 |
oct | 13573654602574762 |
9 | 2004685512132173 |
10 | 413130321230322 |
11 | 10a6aa64905a623 |
12 | 3a403510828356 |
13 | 1496a0397ccbb7 |
14 | 740388567752a |
15 | 32b670392d39c |
hex | 177bd660af9f2 |
413130321230322 has 8 divisors (see below), whose sum is σ = 826260642460656. Its totient is φ = 137710107076772.
The previous prime is 413130321230309. The next prime is 413130321230369. The reversal of 413130321230322 is 223032123031314.
It is a sphenic number, since it is the product of 3 distinct primes.
413130321230322 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 413130321230322.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34427526769188 + ... + 34427526769199.
It is an arithmetic number, because the mean of its divisors is an integer number (103282580307582).
Almost surely, 2413130321230322 is an apocalyptic number.
413130321230322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413130321230322 is a wasteful number, since it uses less digits than its factorization.
413130321230322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68855053538392.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 413130321230322 its reverse (223032123031314), we get a palindrome (636162444261636).
The spelling of 413130321230322 in words is "four hundred thirteen trillion, one hundred thirty billion, three hundred twenty-one million, two hundred thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •