Base | Representation |
---|---|
bin | 1011011010001100100100… |
… | …00111011011101110100100 |
3 | 10021211112000022112011120001 |
4 | 11231012102013123232210 |
5 | 11242030444440214202 |
6 | 125205520222551044 |
7 | 5166434421105451 |
oct | 555062207335644 |
9 | 107745008464501 |
10 | 25089355398052 |
11 | 7aa3377053700 |
12 | 299259a438484 |
13 | 10ccbba7862aa |
14 | 62a48d068828 |
15 | 2d7972055d87 |
hex | 16d1921dbba4 |
25089355398052 has 36 divisors (see below), whose sum is σ = 48261155227740. Its totient is φ = 11404150288960.
The previous prime is 25089355397983. The next prime is 25089355398067.
25089355398052 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 4267802329956 + 20821553068096 = 2065866^2 + 4563064^2 .
It is a super-2 number, since 2×250893553980522 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 90189558 + ... + 90467314.
It is an arithmetic number, because the mean of its divisors is an integer number (1340587645215).
Almost surely, 225089355398052 is an apocalyptic number.
25089355398052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25089355398052 is a deficient number, since it is larger than the sum of its proper divisors (23171799829688).
25089355398052 is a wasteful number, since it uses less digits than its factorization.
25089355398052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464412 (or 464399 counting only the distinct ones).
The product of its (nonzero) digits is 116640000, while the sum is 64.
The spelling of 25089355398052 in words is "twenty-five trillion, eighty-nine billion, three hundred fifty-five million, three hundred ninety-eight thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •