Base | Representation |
---|---|
bin | 100110100111110001… |
… | …100010001011000000 |
3 | 10222001002011011000000 |
4 | 212213301202023000 |
5 | 1134412142021020 |
6 | 31014551000000 |
7 | 2665436545563 |
oct | 464761421300 |
9 | 128032134000 |
10 | 41469485760 |
11 | 1665049748a |
12 | 8054069000 |
13 | 3bab64c771 |
14 | 201580a4da |
15 | 112aa05090 |
hex | 9a7c622c0 |
41469485760 has 784 divisors, whose sum is σ = 158311169280. Its totient is φ = 10319063040.
The previous prime is 41469485741. The next prime is 41469485773. The reversal of 41469485760 is 6758496414.
41469485760 is a `hidden beast` number, since 4 + 1 + 4 + 69 + 4 + 8 + 576 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 41469485697 and 41469485706.
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 316560895 + ... + 316561025.
Almost surely, 241469485760 is an apocalyptic number.
41469485760 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 41469485760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79155584640).
41469485760 is an abundant number, since it is smaller than the sum of its proper divisors (116841683520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41469485760 is a wasteful number, since it uses less digits than its factorization.
41469485760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248 (or 223 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 54.
The spelling of 41469485760 in words is "forty-one billion, four hundred sixty-nine million, four hundred eighty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •