Base | Representation |
---|---|
bin | 11101011110100011101… |
… | …001001000101001101001 |
3 | 21011122121210000100012000 |
4 | 131132203221020221221 |
5 | 231142040304102321 |
6 | 4150325434441213 |
7 | 266231054651541 |
oct | 35364351105151 |
9 | 7148553010160 |
10 | 2025675065961 |
11 | 7110a1846968 |
12 | 28870a593209 |
13 | 1190358b9ab1 |
14 | 70086760321 |
15 | 37a5c099826 |
hex | 1d7a3a48a69 |
2025675065961 has 8 divisors (see below), whose sum is σ = 3001000097760. Its totient is φ = 1350450043956.
The previous prime is 2025675065959. The next prime is 2025675066031. The reversal of 2025675065961 is 1695605765202.
2025675065961 is a `hidden beast` number, since 2 + 0 + 25 + 6 + 7 + 506 + 59 + 61 = 666.
It is not a de Polignac number, because 2025675065961 - 21 = 2025675065959 is a prime.
It is a super-2 number, since 2×20256750659612 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2025675065898 and 2025675065907.
It is not an unprimeable number, because it can be changed into a prime (2025675065941) 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, 37512501195 + ... + 37512501248.
It is an arithmetic number, because the mean of its divisors is an integer number (375125012220).
Almost surely, 22025675065961 is an apocalyptic number.
It is an amenable number.
2025675065961 is a deficient number, since it is larger than the sum of its proper divisors (975325031799).
2025675065961 is an equidigital number, since it uses as much as digits as its factorization.
2025675065961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75025002452 (or 75025002446 counting only the distinct ones).
The product of its (nonzero) digits is 6804000, while the sum is 54.
The spelling of 2025675065961 in words is "two trillion, twenty-five billion, six hundred seventy-five million, sixty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •