Base | Representation |
---|---|
bin | 1100000010010001010… |
… | …11000110111101001010 |
3 | 1110112102001011112201200 |
4 | 12001020223012331022 |
5 | 23233410221330100 |
6 | 513550442125030 |
7 | 41606545012422 |
oct | 6011053067512 |
9 | 1415361145650 |
10 | 413536120650 |
11 | 14a41a3a5174 |
12 | 681904b0776 |
13 | 2ccc4b00ca3 |
14 | 1602dc07482 |
15 | ab54e4ae00 |
hex | 6048ac6f4a |
413536120650 has 72 divisors (see below), whose sum is σ = 1111230486444. Its totient is φ = 110256768000.
The previous prime is 413536120597. The next prime is 413536120693. The reversal of 413536120650 is 56021635314.
413536120650 is a `hidden beast` number, since 4 + 1 + 35 + 3 + 612 + 0 + 6 + 5 + 0 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 174447393561 + 239088727089 = 417669^2 + 488967^2 .
It is a super-3 number, since 3×4135361206503 (a number of 36 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 2557200 + ... + 2714100.
Almost surely, 2413536120650 is an apocalyptic number.
413536120650 is an abundant number, since it is smaller than the sum of its proper divisors (697694365794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413536120650 is a wasteful number, since it uses less digits than its factorization.
413536120650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162776 (or 162768 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 413536120650 its reverse (56021635314), we get a palindrome (469557755964).
The spelling of 413536120650 in words is "four hundred thirteen billion, five hundred thirty-six million, one hundred twenty thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •