Base | Representation |
---|---|
bin | 1101110010011001110… |
… | …01000000001110100100 |
3 | 1200021210111122022110102 |
4 | 12321030321000032210 |
5 | 30230203010222431 |
6 | 1001344223243232 |
7 | 46140426036200 |
oct | 6711471001644 |
9 | 1607714568412 |
10 | 473736414116 |
11 | 172a01945719 |
12 | 77991449518 |
13 | 35899bb8c04 |
14 | 18d01117b00 |
15 | c4ca064dcb |
hex | 6e4ce403a4 |
473736414116 has 72 divisors (see below), whose sum is σ = 1005240600000. Its totient is φ = 194594000832.
The previous prime is 473736414097. The next prime is 473736414121. The reversal of 473736414116 is 611414637374.
It is a happy number.
It is a super-2 number, since 2×4737364141162 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
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, 1616 + ... + 973383.
It is an arithmetic number, because the mean of its divisors is an integer number (13961675000).
Almost surely, 2473736414116 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 473736414116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (502620300000).
473736414116 is an abundant number, since it is smaller than the sum of its proper divisors (531504185884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
473736414116 is a wasteful number, since it uses less digits than its factorization.
473736414116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975121 (or 975112 counting only the distinct ones).
The product of its digits is 1016064, while the sum is 47.
The spelling of 473736414116 in words is "four hundred seventy-three billion, seven hundred thirty-six million, four hundred fourteen thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •