Base | Representation |
---|---|
bin | 1100000001101101010… |
… | …11111100100111000010 |
3 | 1110111122000100000221120 |
4 | 12000312223330213002 |
5 | 23232300443204110 |
6 | 513500502133110 |
7 | 41566222011231 |
oct | 6006653744702 |
9 | 1414560300846 |
10 | 413234350530 |
11 | 14a285021881 |
12 | 68107421196 |
13 | 2cc774335a1 |
14 | 16001ad2b18 |
15 | ab386dc870 |
hex | 6036afc9c2 |
413234350530 has 32 divisors (see below), whose sum is σ = 994705380864. Its totient is φ = 109868833536.
The previous prime is 413234350511. The next prime is 413234350531. The reversal of 413234350530 is 35053432314.
It is a super-2 number, since 2×4132343505302 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 413234350491 and 413234350500.
It is not an unprimeable number, because it can be changed into a prime (413234350531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20426802 + ... + 20447021.
It is an arithmetic number, because the mean of its divisors is an integer number (31084543152).
Almost surely, 2413234350530 is an apocalyptic number.
413234350530 is an abundant number, since it is smaller than the sum of its proper divisors (581471030334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413234350530 is a wasteful number, since it uses less digits than its factorization.
413234350530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40874170.
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 413234350530 its reverse (35053432314), we get a palindrome (448287782844).
The spelling of 413234350530 in words is "four hundred thirteen billion, two hundred thirty-four million, three hundred fifty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •