Base | Representation |
---|---|
bin | 101111001000011001… |
… | …0001101111101100101 |
3 | 100200020201201221220001 |
4 | 1132100302031331211 |
5 | 3124241103100201 |
6 | 114255144541301 |
7 | 10212106056355 |
oct | 1362062157545 |
9 | 320221657801 |
10 | 101213331301 |
11 | 39a19317945 |
12 | 17748181831 |
13 | 970ccc0b64 |
14 | 4c82260b65 |
15 | 2975a0a301 |
hex | 1790c8df65 |
101213331301 has 4 divisors (see below), whose sum is σ = 104478277504. Its totient is φ = 97948385100.
The previous prime is 101213331281. The next prime is 101213331319. The reversal of 101213331301 is 103133312101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103133312101 = 59 ⋅1748022239.
It is a cyclic number.
It is not a de Polignac number, because 101213331301 - 211 = 101213329253 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 (101213031301) 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, 1632473055 + ... + 1632473116.
It is an arithmetic number, because the mean of its divisors is an integer number (26119569376).
Almost surely, 2101213331301 is an apocalyptic number.
It is an amenable number.
101213331301 is a deficient number, since it is larger than the sum of its proper divisors (3264946203).
101213331301 is an equidigital number, since it uses as much as digits as its factorization.
101213331301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3264946202.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101213331301 its reverse (103133312101), we get a palindrome (204346643402).
The spelling of 101213331301 in words is "one hundred one billion, two hundred thirteen million, three hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •