Base | Representation |
---|---|
bin | 1100011000000000011… |
… | …01100000111010111101 |
3 | 1111122112021210112100102 |
4 | 12030000031200322331 |
5 | 23431310024230041 |
6 | 523200413210445 |
7 | 42501661313210 |
oct | 6140015407275 |
9 | 1448467715312 |
10 | 425205305021 |
11 | 1543683450a2 |
12 | 6a4a8490a25 |
13 | 31134568703 |
14 | 1681990d777 |
15 | b0d962209b |
hex | 6300360ebd |
425205305021 has 4 divisors (see below), whose sum is σ = 485948920032. Its totient is φ = 364461690012.
The previous prime is 425205305003. The next prime is 425205305087. The reversal of 425205305021 is 120503502524.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 425205305021 - 26 = 425205304957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425205302021) 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 3 ways as a sum of consecutive naturals, for example, 30371807495 + ... + 30371807508.
It is an arithmetic number, because the mean of its divisors is an integer number (121487230008).
Almost surely, 2425205305021 is an apocalyptic number.
It is an amenable number.
425205305021 is a deficient number, since it is larger than the sum of its proper divisors (60743615011).
425205305021 is an equidigital number, since it uses as much as digits as its factorization.
425205305021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60743615010.
The product of its (nonzero) digits is 12000, while the sum is 29.
Adding to 425205305021 its reverse (120503502524), we get a palindrome (545708807545).
The spelling of 425205305021 in words is "four hundred twenty-five billion, two hundred five million, three hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •