Base | Representation |
---|---|
bin | 11110010011101000010… |
… | …00110000111110001001 |
3 | 10200112212010010102022112 |
4 | 33021310020300332021 |
5 | 114030121104243200 |
6 | 2114214115232105 |
7 | 135143066356310 |
oct | 17116410607611 |
9 | 3615763112275 |
10 | 1041330540425 |
11 | 371697a4071a |
12 | 1499975a8635 |
13 | 77273bba016 |
14 | 38587605277 |
15 | 1c149e72535 |
hex | f274230f89 |
1041330540425 has 24 divisors (see below), whose sum is σ = 1477819467072. Its totient is φ = 713036520000.
The previous prime is 1041330540409. The next prime is 1041330540427. The reversal of 1041330540425 is 5240450331401.
It is not a de Polignac number, because 1041330540425 - 24 = 1041330540409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1041330540391 and 1041330540400.
It is not an unprimeable number, because it can be changed into a prime (1041330540427) 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 23 ways as a sum of consecutive naturals, for example, 4121591 + ... + 4366940.
It is an arithmetic number, because the mean of its divisors is an integer number (61575811128).
Almost surely, 21041330540425 is an apocalyptic number.
It is an amenable number.
1041330540425 is a deficient number, since it is larger than the sum of its proper divisors (436488926647).
1041330540425 is an equidigital number, since it uses as much as digits as its factorization.
1041330540425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8489249 (or 8489244 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 1041330540425 its reverse (5240450331401), we get a palindrome (6281780871826).
The spelling of 1041330540425 in words is "one trillion, forty-one billion, three hundred thirty million, five hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •