Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1011000110110011001 |
3 | 100122200221202201112210 |
4 | 1132010021120312121 |
5 | 3123322313121101 |
6 | 114222132225333 |
7 | 10203622616400 |
oct | 1360411306631 |
9 | 318627681483 |
10 | 101001301401 |
11 | 3991a668720 |
12 | 176a916b249 |
13 | 96a80b4090 |
14 | 4c6202a637 |
15 | 29620c67d6 |
hex | 1784258d99 |
101001301401 has 48 divisors (see below), whose sum is σ = 184042369728. Its totient is φ = 48432182400.
The previous prime is 101001301393. The next prime is 101001301433. The reversal of 101001301401 is 104103100101.
It is not a de Polignac number, because 101001301401 - 23 = 101001301393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101001301001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2381370 + ... + 2423411.
It is an arithmetic number, because the mean of its divisors is an integer number (3834216036).
Almost surely, 2101001301401 is an apocalyptic number.
101001301401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101001301401 is a deficient number, since it is larger than the sum of its proper divisors (83041068327).
101001301401 is a wasteful number, since it uses less digits than its factorization.
101001301401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804822 (or 4804815 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101001301401 its reverse (104103100101), we get a palindrome (205104401502).
The spelling of 101001301401 in words is "one hundred one billion, one million, three hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •