Base | Representation |
---|---|
bin | 1100011001100100101… |
… | …10111101000111110001 |
3 | 1111201200220220210211100 |
4 | 12030302112331013301 |
5 | 23440020420000000 |
6 | 523420110035013 |
7 | 42531555456534 |
oct | 6146226750761 |
9 | 1451626823740 |
10 | 426046640625 |
11 | 15475a248a81 |
12 | 6a6a21a8a69 |
13 | 31239962028 |
14 | 16899558a1b |
15 | b138411a00 |
hex | 63325bd1f1 |
426046640625 has 48 divisors (see below), whose sum is σ = 769250179152. Its totient is φ = 227224500000.
The previous prime is 426046640567. The next prime is 426046640653. The reversal of 426046640625 is 526046640624.
It can be written as a sum of positive squares in 8 ways, for example, as 346365206784 + 79681433841 = 588528^2 + 282279^2 .
It is not a de Polignac number, because 426046640625 - 27 = 426046640497 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 400159 + ... + 1006091.
It is an arithmetic number, because the mean of its divisors is an integer number (16026045399).
Almost surely, 2426046640625 is an apocalyptic number.
426046640625 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
426046640625 is a deficient number, since it is larger than the sum of its proper divisors (343203538527).
426046640625 is an frugal number, since it uses more digits than its factorization.
426046640625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605974 (or 605941 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 45.
Subtracting 426046640625 from its reverse (526046640624), we obtain a palindrome (99999999999).
The spelling of 426046640625 in words is "four hundred twenty-six billion, forty-six million, six hundred forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •