Base | Representation |
---|---|
bin | 11101101101001001000… |
… | …111101111011011001001 |
3 | 21020011001020020222122202 |
4 | 131231021013233123021 |
5 | 231421124033403000 |
6 | 4201435451525545 |
7 | 300324133450625 |
oct | 35551107573311 |
9 | 7204036228582 |
10 | 2041336231625 |
11 | 7177a90a3489 |
12 | 28b75b4598b5 |
13 | 11a6603c9122 |
14 | 70b306d0185 |
15 | 38176e5edd5 |
hex | 1db491ef6c9 |
2041336231625 has 8 divisors (see below), whose sum is σ = 2547587617224. Its totient is φ = 1633068985200.
The previous prime is 2041336231547. The next prime is 2041336231633. The reversal of 2041336231625 is 5261326331402.
It can be written as a sum of positive squares in 4 ways, for example, as 569916285184 + 1471419946441 = 754928^2 + 1213021^2 .
It is not a de Polignac number, because 2041336231625 - 28 = 2041336231369 is a prime.
It is a super-2 number, since 2×20413362316252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8165344802 + ... + 8165345051.
It is an arithmetic number, because the mean of its divisors is an integer number (318448452153).
Almost surely, 22041336231625 is an apocalyptic number.
2041336231625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2041336231625 is a deficient number, since it is larger than the sum of its proper divisors (506251385599).
2041336231625 is an equidigital number, since it uses as much as digits as its factorization.
2041336231625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16330689868 (or 16330689858 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 38.
The spelling of 2041336231625 in words is "two trillion, forty-one billion, three hundred thirty-six million, two hundred thirty-one thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •