Base | Representation |
---|---|
bin | 11101011110011001001… |
… | …110100101000000000000 |
3 | 21011122011121012221022000 |
4 | 131132121032211000000 |
5 | 231141211041111112 |
6 | 4150300233344000 |
7 | 266223533515302 |
oct | 35363116450000 |
9 | 7148147187260 |
10 | 2025500332032 |
11 | 711012150761 |
12 | 28867bb68000 |
13 | 11900863ab38 |
14 | 7006b477972 |
15 | 37a4ba817dc |
hex | 1d7993a5000 |
2025500332032 has 104 divisors (see below), whose sum is σ = 6000750190080. Its totient is φ = 675166740480.
The previous prime is 2025500332003. The next prime is 2025500332091. The reversal of 2025500332032 is 2302330055202.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2025500331987 and 2025500332005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9046944 + ... + 9268127.
Almost surely, 22025500332032 is an apocalyptic number.
It is an amenable number.
2025500332032 is an abundant number, since it is smaller than the sum of its proper divisors (3975249858048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2025500332032 is an equidigital number, since it uses as much as digits as its factorization.
2025500332032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18315104 (or 18315076 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 27.
Adding to 2025500332032 its reverse (2302330055202), we get a palindrome (4327830387234).
It can be divided in two parts, 2025500 and 332032, that added together give a palindrome (2357532).
The spelling of 2025500332032 in words is "two trillion, twenty-five billion, five hundred million, three hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •