Base | Representation |
---|---|
bin | 11010010000111101… |
… | …111110111001111101 |
3 | 2200210102222120201111 |
4 | 122100331332321331 |
5 | 430224201040300 |
6 | 20542242042021 |
7 | 2015604541513 |
oct | 322075767175 |
9 | 80712876644 |
10 | 28201971325 |
11 | 10a62306520 |
12 | 5570949311 |
13 | 2875a153c8 |
14 | 15177264b3 |
15 | b00d5e9ba |
hex | 690f7ee7d |
28201971325 has 12 divisors (see below), whose sum is σ = 38149576128. Its totient is φ = 20510524400.
The previous prime is 28201971323. The next prime is 28201971337. The reversal of 28201971325 is 52317910282.
It is not a de Polignac number, because 28201971325 - 21 = 28201971323 is a prime.
It is a super-2 number, since 2×282019713252 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28201971323) by changing a digit.
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, 51276037 + ... + 51276586.
It is an arithmetic number, because the mean of its divisors is an integer number (3179131344).
Almost surely, 228201971325 is an apocalyptic number.
28201971325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
28201971325 is a deficient number, since it is larger than the sum of its proper divisors (9947604803).
28201971325 is a wasteful number, since it uses less digits than its factorization.
28201971325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102552644 (or 102552639 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 28201971325 in words is "twenty-eight billion, two hundred one million, nine hundred seventy-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •