Base | Representation |
---|---|
bin | 1100010111101110000… |
… | …10000011011010000010 |
3 | 1111122010120000112212020 |
4 | 12023313002003122002 |
5 | 23431001113234402 |
6 | 523133232342310 |
7 | 42465111325260 |
oct | 6136702033202 |
9 | 1448116015766 |
10 | 425051305602 |
11 | 154299421050 |
12 | 6a4649a4996 |
13 | 3110b6992b1 |
14 | 168032a3430 |
15 | b0cad528bc |
hex | 62f7083682 |
425051305602 has 64 divisors (see below), whose sum is σ = 1061674435584. Its totient is φ = 110214786240.
The previous prime is 425051305583. The next prime is 425051305607. The reversal of 425051305602 is 206503150524.
It is a super-3 number, since 3×4250513056023 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (425051305607) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 512473 + ... + 1054860.
It is an arithmetic number, because the mean of its divisors is an integer number (16588663056).
Almost surely, 2425051305602 is an apocalyptic number.
425051305602 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
425051305602 is an abundant number, since it is smaller than the sum of its proper divisors (636623129982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425051305602 is a wasteful number, since it uses less digits than its factorization.
425051305602 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1567943.
The product of its (nonzero) digits is 36000, while the sum is 33.
The spelling of 425051305602 in words is "four hundred twenty-five billion, fifty-one million, three hundred five thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •