Base | Representation |
---|---|
bin | 11110011011000011010… |
… | …01110110000110110001 |
3 | 10200221010211100220000111 |
4 | 33031201221312012301 |
5 | 114111301221144101 |
6 | 2120113345021321 |
7 | 135343614255001 |
oct | 17154151660661 |
9 | 3627124326014 |
10 | 1045315412401 |
11 | 373352331a47 |
12 | 14a70a024841 |
13 | 7775a642a30 |
14 | 3884493c001 |
15 | 1c2cec0a251 |
hex | f361a761b1 |
1045315412401 has 8 divisors (see below), whose sum is σ = 1126839987560. Its totient is φ = 963950222592.
The previous prime is 1045315412399. The next prime is 1045315412431. The reversal of 1045315412401 is 1042145135401.
It can be written as a sum of positive squares in 4 ways, for example, as 230630457600 + 814684954801 = 480240^2 + 902599^2 .
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 1045315412401 - 21 = 1045315412399 is a prime.
It is a super-2 number, since 2×10453154124012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1045315412431) 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, 39832710 + ... + 39858943.
It is an arithmetic number, because the mean of its divisors is an integer number (140854998445).
Almost surely, 21045315412401 is an apocalyptic number.
It is an amenable number.
1045315412401 is a deficient number, since it is larger than the sum of its proper divisors (81524575159).
1045315412401 is a wasteful number, since it uses less digits than its factorization.
1045315412401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79692675.
The product of its (nonzero) digits is 9600, while the sum is 31.
The spelling of 1045315412401 in words is "one trillion, forty-five billion, three hundred fifteen million, four hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •