Base | Representation |
---|---|
bin | 101111001000101000… |
… | …0010010001101001001 |
3 | 100200021021120101112212 |
4 | 1132101100102031021 |
5 | 3124300112304001 |
6 | 114300025514505 |
7 | 10212233054156 |
oct | 1362120221511 |
9 | 320237511485 |
10 | 101221213001 |
11 | 39a22810547 |
12 | 1774a942a35 |
13 | 971182049c |
14 | 4c8331322d |
15 | 29765657bb |
hex | 1791412349 |
101221213001 has 4 divisors (see below), whose sum is σ = 101780446404. Its totient is φ = 100661979600.
The previous prime is 101221212941. The next prime is 101221213003. The reversal of 101221213001 is 100312122101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4547479225 + 96673733776 = 67435^2 + 310924^2 .
It is a cyclic number.
It is not a de Polignac number, because 101221213001 - 226 = 101154104137 is a prime.
It is a super-2 number, since 2×1012212130012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101221213003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 279616430 + ... + 279616791.
It is an arithmetic number, because the mean of its divisors is an integer number (25445111601).
Almost surely, 2101221213001 is an apocalyptic number.
It is an amenable number.
101221213001 is a deficient number, since it is larger than the sum of its proper divisors (559233403).
101221213001 is an equidigital number, since it uses as much as digits as its factorization.
101221213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 559233402.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 101221213001 its reverse (100312122101), we get a palindrome (201533335102).
The spelling of 101221213001 in words is "one hundred one billion, two hundred twenty-one million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.412 sec. • engine limits •