Base | Representation |
---|---|
bin | 101111000010011011… |
… | …0100001011011001001 |
3 | 100122201210000211110012 |
4 | 1132010312201123021 |
5 | 3123333330224001 |
6 | 114223234001305 |
7 | 10204125315014 |
oct | 1360466413311 |
9 | 318653024405 |
10 | 101013133001 |
11 | 39926309a00 |
12 | 176b1116235 |
13 | 96aa697521 |
14 | 4c6382a37b |
15 | 29631622bb |
hex | 1784da16c9 |
101013133001 has 6 divisors (see below), whose sum is σ = 111030964506. Its totient is φ = 91830120800.
The previous prime is 101013132973. The next prime is 101013133009. The reversal of 101013133001 is 100331310101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 74365835401 + 26647297600 = 272701^2 + 163240^2 .
It is not a de Polignac number, because 101013133001 - 26 = 101013132937 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101013133009) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 417409520 + ... + 417409761.
It is an arithmetic number, because the mean of its divisors is an integer number (18505160751).
Almost surely, 2101013133001 is an apocalyptic number.
101013133001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101013133001 is a deficient number, since it is larger than the sum of its proper divisors (10017831505).
101013133001 is an equidigital number, since it uses as much as digits as its factorization.
101013133001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 834819303 (or 834819292 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 101013133001 its reverse (100331310101), we get a palindrome (201344443102).
The spelling of 101013133001 in words is "one hundred one billion, thirteen million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •