Base | Representation |
---|---|
bin | 110000011111010110000111… |
… | …0000111000101110010111100 |
3 | 2001221011222002202110110022112 |
4 | 1200332230032013011302330 |
5 | 421401103043311104034 |
6 | 4111044500523033152 |
7 | 155561043640340012 |
oct | 14076541607056274 |
9 | 2057158082413275 |
10 | 426520554003644 |
11 | 1139a2395404751 |
12 | 3ba0665a66b7b8 |
13 | 153cb93c3c9879 |
14 | 77479c25b28b2 |
15 | 3449ba22807ce |
hex | 183eb0e1c5cbc |
426520554003644 has 12 divisors (see below), whose sum is σ = 746956990707984. Its totient is φ = 213104270944224.
The previous prime is 426520554003641. The next prime is 426520554003647. The reversal of 426520554003644 is 446300455025624.
It is an interprime number because it is at equal distance from previous prime (426520554003641) and next prime (426520554003647).
It is a junction number, because it is equal to n+sod(n) for n = 426520554003592 and 426520554003601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (426520554003641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39001508249 + ... + 39001519184.
It is an arithmetic number, because the mean of its divisors is an integer number (62246415892332).
Almost surely, 2426520554003644 is an apocalyptic number.
It is an amenable number.
426520554003644 is a deficient number, since it is larger than the sum of its proper divisors (320436436704340).
426520554003644 is a wasteful number, since it uses less digits than its factorization.
426520554003644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78003028804 (or 78003028802 counting only the distinct ones).
The product of its (nonzero) digits is 13824000, while the sum is 50.
The spelling of 426520554003644 in words is "four hundred twenty-six trillion, five hundred twenty billion, five hundred fifty-four million, three thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •