Base | Representation |
---|---|
bin | 1100000100010… |
… | …00011111000101 |
3 | 21001110121221121 |
4 | 12002020133011 |
5 | 201403103331 |
6 | 14013313541 |
7 | 2336242603 |
oct | 602103705 |
9 | 231417847 |
10 | 101222341 |
11 | 52156930 |
12 | 29a958b1 |
13 | 17c80c9c |
14 | d62c873 |
15 | 8d46c11 |
hex | 60887c5 |
101222341 has 8 divisors (see below), whose sum is σ = 110527200. Its totient is φ = 91934640.
The previous prime is 101222339. The next prime is 101222371. The reversal of 101222341 is 143222101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101222341 - 21 = 101222339 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101222371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10195 + ... + 17503.
It is an arithmetic number, because the mean of its divisors is an integer number (13815900).
Almost surely, 2101222341 is an apocalyptic number.
101222341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101222341 is a deficient number, since it is larger than the sum of its proper divisors (9304859).
101222341 is a wasteful number, since it uses less digits than its factorization.
101222341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8579.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 101222341 is about 10060.9314181143. The cubic root of 101222341 is about 466.0424310679.
Adding to 101222341 its reverse (143222101), we get a palindrome (244444442).
The spelling of 101222341 in words is "one hundred one million, two hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •