Base | Representation |
---|---|
bin | 1100011000000001011… |
… | …11001010010011111110 |
3 | 1111122112220101122111210 |
4 | 12030000233022103332 |
5 | 23431314304002220 |
6 | 523201330225250 |
7 | 42502126300302 |
oct | 6140057122376 |
9 | 1448486348453 |
10 | 425214125310 |
11 | 154372319997 |
12 | 6a4ab425226 |
13 | 31136336310 |
14 | 1681ab67d02 |
15 | b0da2b56e0 |
hex | 6300bca4fe |
425214125310 has 64 divisors (see below), whose sum is σ = 1099623651840. Its totient is φ = 104610122880.
The previous prime is 425214125299. The next prime is 425214125321. The reversal of 425214125310 is 13521412524.
It is an interprime number because it is at equal distance from previous prime (425214125299) and next prime (425214125321).
It is a super-2 number, since 2×4252141253102 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 405271 + ... + 1007309.
It is an arithmetic number, because the mean of its divisors is an integer number (17181619560).
Almost surely, 2425214125310 is an apocalyptic number.
425214125310 is an abundant number, since it is smaller than the sum of its proper divisors (674409526530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425214125310 is a wasteful number, since it uses less digits than its factorization.
425214125310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603873.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 425214125310 its reverse (13521412524), we get a palindrome (438735537834).
The spelling of 425214125310 in words is "four hundred twenty-five billion, two hundred fourteen million, one hundred twenty-five thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •