Base | Representation |
---|---|
bin | 100110010100100011… |
… | …111010011011000010 |
3 | 10221012121121200200100 |
4 | 212110203322123002 |
5 | 1133232132213340 |
6 | 30522554103230 |
7 | 2654443662345 |
oct | 462443723302 |
9 | 127177550610 |
10 | 41147147970 |
11 | 164a5546315 |
12 | 7b8411ab16 |
13 | 3b59930446 |
14 | 1dc4aa045c |
15 | 110c582830 |
hex | 9948fa6c2 |
41147147970 has 48 divisors (see below), whose sum is σ = 107257695480. Its totient is φ = 10944356352.
The previous prime is 41147147969. The next prime is 41147147971. The reversal of 41147147970 is 7974174114.
41147147970 is a `hidden beast` number, since 41 + 1 + 4 + 71 + 479 + 70 = 666.
It is an interprime number because it is at equal distance from previous prime (41147147969) and next prime (41147147971).
It can be written as a sum of positive squares in 4 ways, for example, as 28150463961 + 12996684009 = 167781^2 + 114003^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (41147147971) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 552639 + ... + 622658.
Almost surely, 241147147970 is an apocalyptic number.
41147147970 is an abundant number, since it is smaller than the sum of its proper divisors (66110547510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41147147970 is a wasteful number, since it uses less digits than its factorization.
41147147970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1175699 (or 1175696 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 45.
The spelling of 41147147970 in words is "forty-one billion, one hundred forty-seven million, one hundred forty-seven thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •