Base | Representation |
---|---|
bin | 11110100100111111010… |
… | …011111100100111111001 |
3 | 21102212211021221001222021 |
4 | 132210333103330213321 |
5 | 233411431101421101 |
6 | 4245154025154441 |
7 | 304546126336453 |
oct | 36447723744771 |
9 | 7385737831867 |
10 | 2101301201401 |
11 | 74017a824846 |
12 | 29b2b562ba21 |
13 | 1231c880c86c |
14 | 739bc6652d3 |
15 | 399d65935a1 |
hex | 1e93f4fc9f9 |
2101301201401 has 4 divisors (see below), whose sum is σ = 2101895968932. Its totient is φ = 2100706433872.
The previous prime is 2101301201381. The next prime is 2101301201411. The reversal of 2101301201401 is 1041021031012.
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 807030925801 + 1294270275600 = 898349^2 + 1137660^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101301201401 - 227 = 2101166983673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2101301201411) 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, 297378466 + ... + 297385531.
It is an arithmetic number, because the mean of its divisors is an integer number (525473992233).
Almost surely, 22101301201401 is an apocalyptic number.
It is an amenable number.
2101301201401 is a deficient number, since it is larger than the sum of its proper divisors (594767531).
2101301201401 is an equidigital number, since it uses as much as digits as its factorization.
2101301201401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594767530.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2101301201401 its reverse (1041021031012), we get a palindrome (3142322232413).
The spelling of 2101301201401 in words is "two trillion, one hundred one billion, three hundred one million, two hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •