Base | Representation |
---|---|
bin | 101111000110001111… |
… | …0010010111101100001 |
3 | 100200001200122011001012 |
4 | 1132030132102331201 |
5 | 3124114044000113 |
6 | 114244042350305 |
7 | 10210240213133 |
oct | 1361436227541 |
9 | 320050564035 |
10 | 101141000033 |
11 | 39991504337 |
12 | 17727abb395 |
13 | 96cb0171a8 |
14 | 4c767d3053 |
15 | 296e4bdaa8 |
hex | 178c792f61 |
101141000033 has 4 divisors (see below), whose sum is σ = 101147542020. Its totient is φ = 101134458048.
The previous prime is 101141000027. The next prime is 101141000053. The reversal of 101141000033 is 330000141101.
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 67421757649 + 33719242384 = 259657^2 + 183628^2 .
It is a cyclic number.
It is not a de Polignac number, because 101141000033 - 28 = 101140999777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101140999981 and 101141000017.
It is not an unprimeable number, because it can be changed into a prime (101141000003) 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, 3247748 + ... + 3278741.
It is an arithmetic number, because the mean of its divisors is an integer number (25286885505).
Almost surely, 2101141000033 is an apocalyptic number.
It is an amenable number.
101141000033 is a deficient number, since it is larger than the sum of its proper divisors (6541987).
101141000033 is an equidigital number, since it uses as much as digits as its factorization.
101141000033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6541986.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 101141000033 its reverse (330000141101), we get a palindrome (431141141134).
The spelling of 101141000033 in words is "one hundred one billion, one hundred forty-one million, thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •