Base | Representation |
---|---|
bin | 11110001000111010010… |
… | …10001110111001001001 |
3 | 10200000000002120202022210 |
4 | 33010131022032321021 |
5 | 113431330020340131 |
6 | 2111423122535333 |
7 | 134550355440015 |
oct | 17043512167111 |
9 | 3600002522283 |
10 | 1035576340041 |
11 | 36a204934811 |
12 | 148850507549 |
13 | 76867a22b19 |
14 | 3819d2db545 |
15 | 1be0ebde146 |
hex | f11d28ee49 |
1035576340041 has 8 divisors (see below), whose sum is σ = 1380785837760. Its totient is φ = 690375534512.
The previous prime is 1035576340039. The next prime is 1035576340079. The reversal of 1035576340041 is 1400436755301.
1035576340041 is digitally balanced in base 2 and base 4, because in such bases 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 1035576340041 - 21 = 1035576340039 is a prime.
It is a super-3 number, since 3×10355763400413 (a number of 37 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1035576340091) 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, 1889781 + ... + 2375378.
It is an arithmetic number, because the mean of its divisors is an integer number (172598229720).
Almost surely, 21035576340041 is an apocalyptic number.
It is an amenable number.
1035576340041 is a deficient number, since it is larger than the sum of its proper divisors (345209497719).
1035576340041 is an equidigital number, since it uses as much as digits as its factorization.
1035576340041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4346095.
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 1035576340041 in words is "one trillion, thirty-five billion, five hundred seventy-six million, three hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •