Base | Representation |
---|---|
bin | 101011100011010101… |
… | …011000001011110100 |
3 | 11110201001011100120220 |
4 | 223203111120023310 |
5 | 1231233002030301 |
6 | 33252152254340 |
7 | 3243563635404 |
oct | 534325301364 |
9 | 143631140526 |
10 | 46763705076 |
11 | 1891798a850 |
12 | 90910a13b0 |
13 | 4543433c0a |
14 | 23989b8804 |
15 | 133a6c7936 |
hex | ae35582f4 |
46763705076 has 96 divisors (see below), whose sum is σ = 121299319680. Its totient is φ = 13902451200.
The previous prime is 46763705063. The next prime is 46763705113. The reversal of 46763705076 is 67050736764.
46763705076 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-2 number, since 2×467637050762 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3189330 + ... + 3203958.
It is an arithmetic number, because the mean of its divisors is an integer number (1263534580).
Almost surely, 246763705076 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 46763705076, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60649659840).
46763705076 is an abundant number, since it is smaller than the sum of its proper divisors (74535614604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46763705076 is a wasteful number, since it uses less digits than its factorization.
46763705076 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15105 (or 15103 counting only the distinct ones).
The product of its (nonzero) digits is 4445280, while the sum is 51.
The spelling of 46763705076 in words is "forty-six billion, seven hundred sixty-three million, seven hundred five thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.013 sec. • engine limits •