Base | Representation |
---|---|
bin | 111100000111011000110… |
… | …101010010101100001101 |
3 | 112121221002120010220011110 |
4 | 330013120311102230031 |
5 | 1020140443430422201 |
6 | 12441445104242233 |
7 | 604314354460302 |
oct | 74073065225415 |
9 | 15557076126143 |
10 | 4131101420301 |
11 | 1352a99066109 |
12 | 568775610379 |
13 | 23c73ac2a54b |
14 | 103d36bd70a9 |
15 | 726d58856d6 |
hex | 3c1d8d52b0d |
4131101420301 has 8 divisors (see below), whose sum is σ = 5612062307040. Its totient is φ = 2702104073552.
The previous prime is 4131101420297. The next prime is 4131101420321. The reversal of 4131101420301 is 1030241011314.
4131101420301 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 4131101420301 - 22 = 4131101420297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4131101420321) 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, 12990884811 + ... + 12990885128.
It is an arithmetic number, because the mean of its divisors is an integer number (701507788380).
Almost surely, 24131101420301 is an apocalyptic number.
It is an amenable number.
4131101420301 is a deficient number, since it is larger than the sum of its proper divisors (1480960886739).
4131101420301 is a wasteful number, since it uses less digits than its factorization.
4131101420301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25981769995.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 4131101420301 its reverse (1030241011314), we get a palindrome (5161342431615).
The spelling of 4131101420301 in words is "four trillion, one hundred thirty-one billion, one hundred one million, four hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •