Base | Representation |
---|---|
bin | 100110011110000010… |
… | …111001011111010000 |
3 | 10221121201000200222010 |
4 | 212132002321133100 |
5 | 1134043400444202 |
6 | 30550440342520 |
7 | 2661415315116 |
oct | 463602713720 |
9 | 127551020863 |
10 | 41306265552 |
11 | 16577345752 |
12 | 8009474a40 |
13 | 3b838a2366 |
14 | 1ddbc7dab6 |
15 | 111b51376c |
hex | 99e0b97d0 |
41306265552 has 20 divisors (see below), whose sum is σ = 106707852800. Its totient is φ = 13768755168.
The previous prime is 41306265551. The next prime is 41306265571. The reversal of 41306265552 is 25556260314.
41306265552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-4 number, since 4×413062655524 (a number of 44 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 41306265552.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41306265551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 430273552 + ... + 430273647.
It is an arithmetic number, because the mean of its divisors is an integer number (5335392640).
Almost surely, 241306265552 is an apocalyptic number.
It is an amenable number.
41306265552 is an abundant number, since it is smaller than the sum of its proper divisors (65401587248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41306265552 is a wasteful number, since it uses less digits than its factorization.
41306265552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 860547210 (or 860547204 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The spelling of 41306265552 in words is "forty-one billion, three hundred six million, two hundred sixty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •