Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1000101111100110101 |
3 | 100122210122121220021011 |
4 | 1132012131011330311 |
5 | 3123412221140201 |
6 | 114230034152221 |
7 | 10204603003402 |
oct | 1360635057465 |
9 | 318718556234 |
10 | 101040021301 |
11 | 3993a50453a |
12 | 176ba122671 |
13 | 96b312006b |
14 | 4c672292a9 |
15 | 29656c4151 |
hex | 1786745f35 |
101040021301 has 4 divisors (see below), whose sum is σ = 101040777900. Its totient is φ = 101039264704.
The previous prime is 101040021293. The next prime is 101040021317. The reversal of 101040021301 is 103120040101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 20959511076 + 80080510225 = 144774^2 + 282985^2 .
It is a cyclic number.
It is not a de Polignac number, because 101040021301 - 23 = 101040021293 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 (101040022301) 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, 118516 + ... + 464893.
It is an arithmetic number, because the mean of its divisors is an integer number (25260194475).
Almost surely, 2101040021301 is an apocalyptic number.
It is an amenable number.
101040021301 is a deficient number, since it is larger than the sum of its proper divisors (756599).
101040021301 is an equidigital number, since it uses as much as digits as its factorization.
101040021301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756598.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101040021301 its reverse (103120040101), we get a palindrome (204160061402).
The spelling of 101040021301 in words is "one hundred one billion, forty million, twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •