Base | Representation |
---|---|
bin | 1100000001100100101… |
… | …10111001111000010100 |
3 | 1110111102221200022002011 |
4 | 12000302112321320110 |
5 | 23232123400203320 |
6 | 513445345354004 |
7 | 41564350502311 |
oct | 6006226717024 |
9 | 1414387608064 |
10 | 413161725460 |
11 | 14a248028560 |
12 | 680a7038904 |
13 | 2cc65385c83 |
14 | 15dd61c9d08 |
15 | ab3214405a |
hex | 60325b9e14 |
413161725460 has 48 divisors (see below), whose sum is σ = 968527973952. Its totient is φ = 146746656000.
The previous prime is 413161725451. The next prime is 413161725467. The reversal of 413161725460 is 64527161314.
It is a super-2 number, since 2×4131617254602 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413161725467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21827841 + ... + 21846760.
It is an arithmetic number, because the mean of its divisors is an integer number (20177666124).
Almost surely, 2413161725460 is an apocalyptic number.
It is an amenable number.
413161725460 is an abundant number, since it is smaller than the sum of its proper divisors (555366248492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413161725460 is a wasteful number, since it uses less digits than its factorization.
413161725460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43674664 (or 43674662 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
Adding to 413161725460 its reverse (64527161314), we get a palindrome (477688886774).
The spelling of 413161725460 in words is "four hundred thirteen billion, one hundred sixty-one million, seven hundred twenty-five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •