Base | Representation |
---|---|
bin | 101111001111001011… |
… | …1101000010001100101 |
3 | 100200211121121000212221 |
4 | 1132132113220101211 |
5 | 3130222424222323 |
6 | 114333525512341 |
7 | 10220544221563 |
oct | 1363627502145 |
9 | 320747530787 |
10 | 101441242213 |
11 | 3a025a33773 |
12 | 177b05726b1 |
13 | 974829b29c |
14 | 4ca462aa33 |
15 | 298aa2955d |
hex | 179e5e8465 |
101441242213 has 4 divisors (see below), whose sum is σ = 101888120160. Its totient is φ = 100994364268.
The previous prime is 101441242211. The next prime is 101441242219. The reversal of 101441242213 is 312242144101.
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: 312242144101 = 223 ⋅1400188987.
It is a cyclic number.
It is not a de Polignac number, because 101441242213 - 21 = 101441242211 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 (101441242211) 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, 223438633 + ... + 223439086.
It is an arithmetic number, because the mean of its divisors is an integer number (25472030040).
Almost surely, 2101441242213 is an apocalyptic number.
It is an amenable number.
101441242213 is a deficient number, since it is larger than the sum of its proper divisors (446877947).
101441242213 is an equidigital number, since it uses as much as digits as its factorization.
101441242213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 446877946.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 101441242213 its reverse (312242144101), we get a palindrome (413683386314).
The spelling of 101441242213 in words is "one hundred one billion, four hundred forty-one million, two hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •