Base | Representation |
---|---|
bin | 111010001100110… |
… | …1101011110011101 |
3 | 12001002201102221202 |
4 | 1310121231132131 |
5 | 12444420200200 |
6 | 521441205245 |
7 | 66252231020 |
oct | 16431553635 |
9 | 5032642852 |
10 | 1952896925 |
11 | 9123a5401 |
12 | 466030825 |
13 | 251794715 |
14 | 1475171b7 |
15 | b66ab1d5 |
hex | 7466d79d |
1952896925 has 24 divisors (see below), whose sum is σ = 2856817152. Its totient is φ = 1295928000.
The previous prime is 1952896909. The next prime is 1952896927. The reversal of 1952896925 is 5296982591.
It is not a de Polignac number, because 1952896925 - 24 = 1952896909 is a prime.
It is a super-3 number, since 3×19528969253 (a number of 29 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1952896927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 174566 + ... + 185415.
It is an arithmetic number, because the mean of its divisors is an integer number (119034048).
Almost surely, 21952896925 is an apocalyptic number.
It is an amenable number.
1952896925 is a deficient number, since it is larger than the sum of its proper divisors (903920227).
1952896925 is a wasteful number, since it uses less digits than its factorization.
1952896925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360029 (or 360024 counting only the distinct ones).
The product of its digits is 3499200, while the sum is 56.
The square root of 1952896925 is about 44191.5933747585. The cubic root of 1952896925 is about 1249.9513421060.
The spelling of 1952896925 in words is "one billion, nine hundred fifty-two million, eight hundred ninety-six thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •