Base | Representation |
---|---|
bin | 1101110011001001111… |
… | …11010001101000001100 |
3 | 1200022211200101202010020 |
4 | 12321210333101220030 |
5 | 30232020010231221 |
6 | 1001452304542140 |
7 | 46153435356450 |
oct | 6714477215014 |
9 | 1608750352106 |
10 | 474140711436 |
11 | 17309a086237 |
12 | 77a84921950 |
13 | 359328a34b2 |
14 | 18d3caba660 |
15 | c5007c6ac6 |
hex | 6e64fd1a0c |
474140711436 has 192 divisors, whose sum is σ = 1325618058240. Its totient is φ = 129098280960.
The previous prime is 474140711423. The next prime is 474140711441. The reversal of 474140711436 is 634117041474.
474140711436 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25431510 + ... + 25450146.
It is an arithmetic number, because the mean of its divisors is an integer number (6904260720).
Almost surely, 2474140711436 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 474140711436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (662809029120).
474140711436 is an abundant number, since it is smaller than the sum of its proper divisors (851477346804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
474140711436 is a wasteful number, since it uses less digits than its factorization.
474140711436 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18864 (or 18862 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 42.
The spelling of 474140711436 in words is "four hundred seventy-four billion, one hundred forty million, seven hundred eleven thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •