Base | Representation |
---|---|
bin | 1011101001001101010… |
… | …1000101001000101001 |
3 | 201010100011001201212201 |
4 | 2322103111011020221 |
5 | 11234140302204200 |
6 | 231521445140201 |
7 | 20311120155220 |
oct | 2722325051051 |
9 | 633304051781 |
10 | 200040272425 |
11 | 779225784a4 |
12 | 329290ba661 |
13 | 15b2c77ca06 |
14 | 99795a5cb7 |
15 | 530bc7bc6a |
hex | 2e93545229 |
200040272425 has 24 divisors (see below), whose sum is σ = 283797050112. Its totient is φ = 137019792000.
The previous prime is 200040272363. The next prime is 200040272461. The reversal of 200040272425 is 524272040002.
It is not a de Polignac number, because 200040272425 - 29 = 200040271913 is a prime.
It is a super-2 number, since 2×2000402724252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200040272393 and 200040272402.
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 23 ways as a sum of consecutive naturals, for example, 467956 + ... + 786805.
It is an arithmetic number, because the mean of its divisors is an integer number (11824877088).
Almost surely, 2200040272425 is an apocalyptic number.
200040272425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
200040272425 is a deficient number, since it is larger than the sum of its proper divisors (83756777687).
200040272425 is a wasteful number, since it uses less digits than its factorization.
200040272425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255689 (or 1255684 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 28.
The spelling of 200040272425 in words is "two hundred billion, forty million, two hundred seventy-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •