Base | Representation |
---|---|
bin | 1100000001100000010… |
… | …00100001011110001010 |
3 | 1110111100100110000121000 |
4 | 12000300020201132022 |
5 | 23232034321313114 |
6 | 513441533355430 |
7 | 41563415316612 |
oct | 6006010413612 |
9 | 1414310400530 |
10 | 413124401034 |
11 | 14a228a55124 |
12 | 68096638b76 |
13 | 2cc5a718207 |
14 | 15dd1271a42 |
15 | ab2dc1ee09 |
hex | 603022178a |
413124401034 has 64 divisors (see below), whose sum is σ = 923125006080. Its totient is φ = 136948008960.
The previous prime is 413124401021. The next prime is 413124401093. The reversal of 413124401034 is 430104421314.
413124401034 is a `hidden beast` number, since 413 + 1 + 244 + 0 + 1 + 0 + 3 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 413124400989 and 413124401007.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 45091414 + ... + 45100574.
It is an arithmetic number, because the mean of its divisors is an integer number (14423828220).
Almost surely, 2413124401034 is an apocalyptic number.
413124401034 is an abundant number, since it is smaller than the sum of its proper divisors (510000605046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413124401034 is a wasteful number, since it uses less digits than its factorization.
413124401034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13692 (or 13686 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 413124401034 its reverse (430104421314), we get a palindrome (843228822348).
The spelling of 413124401034 in words is "four hundred thirteen billion, one hundred twenty-four million, four hundred one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •