Base | Representation |
---|---|
bin | 101011001000011110… |
… | …010110101101111110 |
3 | 11102112122012220022210 |
4 | 223020132112231332 |
5 | 1224322121323114 |
6 | 33135333521250 |
7 | 3226452426000 |
oct | 531036265576 |
9 | 142478186283 |
10 | 46313073534 |
11 | 18706582692 |
12 | 8b861a3226 |
13 | 44a0c75930 |
14 | 2354bd4370 |
15 | 1310d62259 |
hex | ac8796b7e |
46313073534 has 256 divisors, whose sum is σ = 126443520000. Its totient is φ = 11194485120.
The previous prime is 46313073533. The next prime is 46313073551. The reversal of 46313073534 is 43537031364.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 46313073492 and 46313073501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46313073533) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 15756637 + ... + 15759575.
It is an arithmetic number, because the mean of its divisors is an integer number (493920000).
Almost surely, 246313073534 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46313073534, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63221760000).
46313073534 is an abundant number, since it is smaller than the sum of its proper divisors (80130446466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46313073534 is a wasteful number, since it uses less digits than its factorization.
46313073534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3028 (or 3014 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 39.
The spelling of 46313073534 in words is "forty-six billion, three hundred thirteen million, seventy-three thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •