Base | Representation |
---|---|
bin | 1100000010001010000… |
… | …00110111111110000000 |
3 | 1110112020202121221112110 |
4 | 12001011000313332000 |
5 | 23233244011430233 |
6 | 513540410055320 |
7 | 41605201052613 |
oct | 6010500677600 |
9 | 1415222557473 |
10 | 413474717568 |
11 | 14a398776120 |
12 | 68173a1a540 |
13 | 2ccb51824c3 |
14 | 160259c217a |
15 | ab4e86c663 |
hex | 6045037f80 |
413474717568 has 64 divisors (see below), whose sum is σ = 1198136977920. Its totient is φ = 125295367680.
The previous prime is 413474717563. The next prime is 413474717603. The reversal of 413474717568 is 865717474314.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×4134747175682 (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 (413474717563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48939280 + ... + 48947727.
It is an arithmetic number, because the mean of its divisors is an integer number (18720890280).
Almost surely, 2413474717568 is an apocalyptic number.
413474717568 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
413474717568 is an abundant number, since it is smaller than the sum of its proper divisors (784662260352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413474717568 is a wasteful number, since it uses less digits than its factorization.
413474717568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97887035 (or 97887023 counting only the distinct ones).
The product of its digits is 15805440, while the sum is 57.
The spelling of 413474717568 in words is "four hundred thirteen billion, four hundred seventy-four million, seven hundred seventeen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •