Base | Representation |
---|---|
bin | 101111000010010101… |
… | …1110101011001010101 |
3 | 100122201120202111010120 |
4 | 1132010223311121111 |
5 | 3123332121044341 |
6 | 114223053542153 |
7 | 10204062435402 |
oct | 1360453653125 |
9 | 318646674116 |
10 | 101010331221 |
11 | 39924775988 |
12 | 176b01a4959 |
13 | 96a9c26177 |
14 | 4c632db2a9 |
15 | 2962cac066 |
hex | 1784af5655 |
101010331221 has 8 divisors (see below), whose sum is σ = 134681937504. Its totient is φ = 67339472880.
The previous prime is 101010331217. The next prime is 101010331229. The reversal of 101010331221 is 122133010101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101010331221 - 22 = 101010331217 is a prime.
It is a super-2 number, since 2×1010103312212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101010331221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010331229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341611 + ... + 564551.
It is an arithmetic number, because the mean of its divisors is an integer number (16835242188).
Almost surely, 2101010331221 is an apocalyptic number.
It is an amenable number.
101010331221 is a deficient number, since it is larger than the sum of its proper divisors (33671606283).
101010331221 is a wasteful number, since it uses less digits than its factorization.
101010331221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 373971.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101010331221 its reverse (122133010101), we get a palindrome (223143341322).
The spelling of 101010331221 in words is "one hundred one billion, ten million, three hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •