Base | Representation |
---|---|
bin | 101111001000001101… |
… | …0010001111101011100 |
3 | 100200020021221011002122 |
4 | 1132100122101331130 |
5 | 3124233001244340 |
6 | 114254402242112 |
7 | 10212001532564 |
oct | 1362032217534 |
9 | 320207834078 |
10 | 101207056220 |
11 | 39a15821326 |
12 | 17746056338 |
13 | 970b9048aa |
14 | 4c814a9da4 |
15 | 29751badb5 |
hex | 1790691f5c |
101207056220 has 12 divisors (see below), whose sum is σ = 212534818104. Its totient is φ = 40482822480.
The previous prime is 101207056213. The next prime is 101207056241. The reversal of 101207056220 is 22650702101.
It is a self number, because there is not a number n which added to its sum of digits gives 101207056220.
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 3 ways as a sum of consecutive naturals, for example, 2530176386 + ... + 2530176425.
It is an arithmetic number, because the mean of its divisors is an integer number (17711234842).
Almost surely, 2101207056220 is an apocalyptic number.
101207056220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101207056220 is an abundant number, since it is smaller than the sum of its proper divisors (111327761884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101207056220 is a wasteful number, since it uses less digits than its factorization.
101207056220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5060352820 (or 5060352818 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 101207056220 its reverse (22650702101), we get a palindrome (123857758321).
The spelling of 101207056220 in words is "one hundred one billion, two hundred seven million, fifty-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •