Base | Representation |
---|---|
bin | 10010100001111010100011… |
… | …011111010000001101110000 |
3 | 101200112220000012021202222200 |
4 | 102201322203133100031300 |
5 | 41140210141300302032 |
6 | 445154254410303200 |
7 | 23110565165312100 |
oct | 2241724337201560 |
9 | 350486005252880 |
10 | 81495452353392 |
11 | 23a700332a9300 |
12 | 9182446127b00 |
13 | 3661cb005bb6c |
14 | 161a588271200 |
15 | 964d3c93247c |
hex | 4a1ea37d0370 |
81495452353392 has 540 divisors, whose sum is σ = 304301774846160. Its totient is φ = 20247312476160.
The previous prime is 81495452353387. The next prime is 81495452353411. The reversal of 81495452353392 is 29335325459418.
81495452353392 is a `hidden beast` number, since 8 + 1 + 4 + 9 + 5 + 4 + 5 + 2 + 3 + 533 + 92 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 17561784 + ... + 21711912.
Almost surely, 281495452353392 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 81495452353392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152150887423080).
81495452353392 is an abundant number, since it is smaller than the sum of its proper divisors (222806322492768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81495452353392 is a wasteful number, since it uses less digits than its factorization.
81495452353392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4150202 (or 4150175 counting only the distinct ones).
The product of its digits is 139968000, while the sum is 63.
The spelling of 81495452353392 in words is "eighty-one trillion, four hundred ninety-five billion, four hundred fifty-two million, three hundred fifty-three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •