Base | Representation |
---|---|
bin | 11110010011111100101… |
… | …00010110101000000001 |
3 | 10200120022000112110112221 |
4 | 33021332110112220001 |
5 | 114030443321203101 |
6 | 2114243100251041 |
7 | 135150242260501 |
oct | 17117624265001 |
9 | 3616260473487 |
10 | 1041501350401 |
11 | 3717753a6796 |
12 | 149a24840a81 |
13 | 772a03c3c05 |
14 | 385a2189a01 |
15 | 1c159e62aa1 |
hex | f27e516a01 |
1041501350401 has 32 divisors (see below), whose sum is σ = 1113749028000. Its totient is φ = 972154552320.
The previous prime is 1041501350387. The next prime is 1041501350437. The reversal of 1041501350401 is 1040531051401.
It can be written as a sum of positive squares in 16 ways, for example, as 540520510401 + 500980840000 = 735201^2 + 707800^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041501350401 - 211 = 1041501348353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1041501350441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76703925 + ... + 76717501.
It is an arithmetic number, because the mean of its divisors is an integer number (34804657125).
Almost surely, 21041501350401 is an apocalyptic number.
It is an amenable number.
1041501350401 is a deficient number, since it is larger than the sum of its proper divisors (72247677599).
1041501350401 is a wasteful number, since it uses less digits than its factorization.
1041501350401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14229.
The product of its (nonzero) digits is 1200, while the sum is 25.
Subtracting from 1041501350401 its reverse (1040531051401), we obtain a cube (970299000 = 9903).
The spelling of 1041501350401 in words is "one trillion, forty-one billion, five hundred one million, three hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •