Base | Representation |
---|---|
bin | 11110010111101111111… |
… | …10001010001000010001 |
3 | 10200202120021001002221121 |
4 | 33023313332022020101 |
5 | 114044133320234101 |
6 | 2115221410122241 |
7 | 135251644432603 |
oct | 17136776121021 |
9 | 3622507032847 |
10 | 1043542352401 |
11 | 3726224a87aa |
12 | 14a2b4280381 |
13 | 775371c5bc3 |
14 | 38717279173 |
15 | 1c2292240a1 |
hex | f2f7f8a211 |
1043542352401 has 4 divisors (see below), whose sum is σ = 1050545992500. Its totient is φ = 1036538712304.
The previous prime is 1043542352389. The next prime is 1043542352429. The reversal of 1043542352401 is 1042532453401.
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 75284384400 + 968257968001 = 274380^2 + 984001^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043542352401 - 27 = 1043542352273 is a prime.
It is a super-2 number, since 2×10435423524012 (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 (1043542352491) 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, 3501819826 + ... + 3501820123.
It is an arithmetic number, because the mean of its divisors is an integer number (262636498125).
Almost surely, 21043542352401 is an apocalyptic number.
It is an amenable number.
1043542352401 is a deficient number, since it is larger than the sum of its proper divisors (7003640099).
1043542352401 is an equidigital number, since it uses as much as digits as its factorization.
1043542352401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7003640098.
The product of its (nonzero) digits is 57600, while the sum is 34.
The spelling of 1043542352401 in words is "one trillion, forty-three billion, five hundred forty-two million, three hundred fifty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •