Base | Representation |
---|---|
bin | 101111001100010011… |
… | …0010000011000100110 |
3 | 100200120212101121111000 |
4 | 1132120212100120212 |
5 | 3130023132210342 |
6 | 114320150254130 |
7 | 10215260204403 |
oct | 1363046203046 |
9 | 320525347430 |
10 | 101344413222 |
11 | 39a86308708 |
12 | 17784057346 |
13 | 97311c7c20 |
14 | 4c958232aa |
15 | 298229e44c |
hex | 1798990626 |
101344413222 has 64 divisors (see below), whose sum is σ = 244278720000. Its totient is φ = 30958529184.
The previous prime is 101344413199. The next prime is 101344413223. The reversal of 101344413222 is 222314443101.
101344413222 is a `hidden beast` number, since 10 + 13 + 4 + 4 + 413 + 222 = 666.
It is a super-2 number, since 2×1013444132222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101344413223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 421722 + ... + 616877.
It is an arithmetic number, because the mean of its divisors is an integer number (3816855000).
Almost surely, 2101344413222 is an apocalyptic number.
101344413222 is an abundant number, since it is smaller than the sum of its proper divisors (142934306778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101344413222 is a wasteful number, since it uses less digits than its factorization.
101344413222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1038762 (or 1038756 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 101344413222 its reverse (222314443101), we get a palindrome (323658856323).
The spelling of 101344413222 in words is "one hundred one billion, three hundred forty-four million, four hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •