Base | Representation |
---|---|
bin | 1100000101001111100… |
… | …11010111010111110000 |
3 | 1110200112021022202000110 |
4 | 12002213303113113300 |
5 | 23300142310324220 |
6 | 514413054021320 |
7 | 41664234542403 |
oct | 6024763272760 |
9 | 1420467282013 |
10 | 415132120560 |
11 | 150069294563 |
12 | 68556aa7840 |
13 | 301ba666131 |
14 | 16141b79d3a |
15 | abea109be0 |
hex | 60a7cd75f0 |
415132120560 has 160 divisors (see below), whose sum is σ = 1316303161920. Its totient is φ = 108189712384.
The previous prime is 415132120553. The next prime is 415132120577. The reversal of 415132120560 is 65021231514.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3205546 + ... + 3332534.
It is an arithmetic number, because the mean of its divisors is an integer number (8226894762).
Almost surely, 2415132120560 is an apocalyptic number.
415132120560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 415132120560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (658151580960).
415132120560 is an abundant number, since it is smaller than the sum of its proper divisors (901171041360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
415132120560 is a wasteful number, since it uses less digits than its factorization.
415132120560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127315 (or 127309 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 415132120560 in words is "four hundred fifteen billion, one hundred thirty-two million, one hundred twenty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •