Base | Representation |
---|---|
bin | 100101110001000000… |
… | …0010101001100100100 |
3 | 21202100002010020101221 |
4 | 1023202000111030210 |
5 | 2312043343231324 |
6 | 101131331030124 |
7 | 5600522251303 |
oct | 1134200251444 |
9 | 252302106357 |
10 | 81101148964 |
11 | 31438536650 |
12 | 1387473b344 |
13 | 78562c8754 |
14 | 3cd50d643a |
15 | 2199ed00e4 |
hex | 12e2015324 |
81101148964 has 48 divisors (see below), whose sum is σ = 158738380416. Its totient is φ = 35934969600.
The previous prime is 81101148959. The next prime is 81101149001. The reversal of 81101148964 is 46984110118.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 81101148964.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2213377 + ... + 2249719.
It is an arithmetic number, because the mean of its divisors is an integer number (3307049592).
Almost surely, 281101148964 is an apocalyptic number.
It is an amenable number.
81101148964 is a deficient number, since it is larger than the sum of its proper divisors (77637231452).
81101148964 is a wasteful number, since it uses less digits than its factorization.
81101148964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37636 (or 37634 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 43.
The spelling of 81101148964 in words is "eighty-one billion, one hundred one million, one hundred forty-eight thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •