Base | Representation |
---|---|
bin | 1001010001110010110011… |
… | …0111100111001101000001 |
3 | 1100010020100010220001201211 |
4 | 2110130230313213031001 |
5 | 2314114230311312001 |
6 | 33410225040530121 |
7 | 2102006504114056 |
oct | 224345467471501 |
9 | 40106303801654 |
10 | 10201300104001 |
11 | 328338aa63636 |
12 | 11890b6920941 |
13 | 58cc9491aab6 |
14 | 273a61b5b02d |
15 | 12a55c5c8351 |
hex | 9472cde7341 |
10201300104001 has 8 divisors (see below), whose sum is σ = 10420603830144. Its totient is φ = 9982090327440.
The previous prime is 10201300103989. The next prime is 10201300104011. The reversal of 10201300104001 is 10040100310201.
10201300104001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10201300104001 - 225 = 10201266549569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201300104011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23267875 + ... + 23702248.
It is an arithmetic number, because the mean of its divisors is an integer number (1302575478768).
Almost surely, 210201300104001 is an apocalyptic number.
It is an amenable number.
10201300104001 is a deficient number, since it is larger than the sum of its proper divisors (219303726143).
10201300104001 is an equidigital number, since it uses as much as digits as its factorization.
10201300104001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46974791.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10201300104001 its reverse (10040100310201), we get a palindrome (20241400414202).
The spelling of 10201300104001 in words is "ten trillion, two hundred one billion, three hundred million, one hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •