Base | Representation |
---|---|
bin | 1100011010101100010… |
… | …11100000111100000001 |
3 | 1111210020210202210102201 |
4 | 12031112023200330001 |
5 | 23442233242341002 |
6 | 523555455113201 |
7 | 42552503642155 |
oct | 6152613407401 |
9 | 1453223683381 |
10 | 426647621377 |
11 | 154a3850678a |
12 | 6a82b512801 |
13 | 31304312143 |
14 | 169152b9065 |
15 | b171075087 |
hex | 63562e0f01 |
426647621377 has 4 divisors (see below), whose sum is σ = 426654233136. Its totient is φ = 426641009620.
The previous prime is 426647621327. The next prime is 426647621383. The reversal of 426647621377 is 773126746624.
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 a cyclic number.
It is not a de Polignac number, because 426647621377 - 219 = 426647097089 is a prime.
It is a super-2 number, since 2×4266476213772 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (426647621327) 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, 3208123 + ... + 3338464.
It is an arithmetic number, because the mean of its divisors is an integer number (106663558284).
Almost surely, 2426647621377 is an apocalyptic number.
It is an amenable number.
426647621377 is a deficient number, since it is larger than the sum of its proper divisors (6611759).
426647621377 is an equidigital number, since it uses as much as digits as its factorization.
426647621377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6611758.
The product of its digits is 14224896, while the sum is 55.
The spelling of 426647621377 in words is "four hundred twenty-six billion, six hundred forty-seven million, six hundred twenty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •