Base | Representation |
---|---|
bin | 100011100101010010001… |
… | …111010001001000000010 |
3 | 22122202112022112101101120 |
4 | 203211102033101020002 |
5 | 310030300312003232 |
6 | 5111152231413110 |
7 | 341442510062466 |
oct | 43452217211002 |
9 | 8582468471346 |
10 | 2445216125442 |
11 | 8630128354a2 |
12 | 335a95b24196 |
13 | 1497767c580c |
14 | 864c5ca04a6 |
15 | 439142a692c |
hex | 239523d1202 |
2445216125442 has 8 divisors (see below), whose sum is σ = 4890432250896. Its totient is φ = 815072041812.
The previous prime is 2445216125437. The next prime is 2445216125447.
2445216125442 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (2445216125437) and next prime (2445216125447).
It is a sphenic number, since it is the product of 3 distinct primes.
2445216125442 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2445216125394 and 2445216125403.
It is not an unprimeable number, because it can be changed into a prime (2445216125447) 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, 203768010448 + ... + 203768010459.
It is an arithmetic number, because the mean of its divisors is an integer number (611304031362).
Almost surely, 22445216125442 is an apocalyptic number.
2445216125442 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2445216125442 is a wasteful number, since it uses less digits than its factorization.
2445216125442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407536020912.
The product of its digits is 614400, while the sum is 42.
The spelling of 2445216125442 in words is "two trillion, four hundred forty-five billion, two hundred sixteen million, one hundred twenty-five thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •