Base | Representation |
---|---|
bin | 10101010000101011010000… |
… | …01001101000100111010100 |
3 | 20010112111021202200212101110 |
4 | 22220111220021220213110 |
5 | 22111443022342414301 |
6 | 243233441521055020 |
7 | 12563516462150232 |
oct | 1250255011504724 |
9 | 203474252625343 |
10 | 46752466373076 |
11 | 13995678484822 |
12 | 52b0b36487470 |
13 | 201197aabb859 |
14 | b78b8d6b9952 |
15 | 561213dd90d6 |
hex | 2a85682689d4 |
46752466373076 has 48 divisors (see below), whose sum is σ = 109212956193600. Its totient is φ = 15566462446080.
The previous prime is 46752466373047. The next prime is 46752466373083. The reversal of 46752466373076 is 67037366425764.
It is a super-2 number, since 2×467524663730762 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46752466372998 and 46752466373016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 163014835 + ... + 163301381.
It is an arithmetic number, because the mean of its divisors is an integer number (2275269920700).
Almost surely, 246752466373076 is an apocalyptic number.
It is an amenable number.
46752466373076 is an abundant number, since it is smaller than the sum of its proper divisors (62460489820524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46752466373076 is a wasteful number, since it uses less digits than its factorization.
46752466373076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301944 (or 301942 counting only the distinct ones).
The product of its (nonzero) digits is 640120320, while the sum is 66.
The spelling of 46752466373076 in words is "forty-six trillion, seven hundred fifty-two billion, four hundred sixty-six million, three hundred seventy-three thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •