Base | Representation |
---|---|
bin | 1100011010000000000… |
… | …01000111011001001001 |
3 | 1111202021220010010122221 |
4 | 12031000001013121021 |
5 | 23441003100442203 |
6 | 523454533414041 |
7 | 42540340325605 |
oct | 6150001073111 |
9 | 1452256103587 |
10 | 426275796553 |
11 | 154867635242 |
12 | 6a746a9a321 |
13 | 31275287059 |
14 | 168bbb6a505 |
15 | b14d5c9abd |
hex | 6340047649 |
426275796553 has 4 divisors (see below), whose sum is σ = 435345494400. Its totient is φ = 417206098708.
The previous prime is 426275796491. The next prime is 426275796643. The reversal of 426275796553 is 355697572624.
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 426275796553 - 237 = 288836843081 is a prime.
It is a super-2 number, since 2×4262757965532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 426275796491 and 426275796500.
It is not an unprimeable number, because it can be changed into a prime (426275796053) 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, 4534848853 + ... + 4534848946.
It is an arithmetic number, because the mean of its divisors is an integer number (108836373600).
Almost surely, 2426275796553 is an apocalyptic number.
It is an amenable number.
426275796553 is a deficient number, since it is larger than the sum of its proper divisors (9069697847).
426275796553 is an equidigital number, since it uses as much as digits as its factorization.
426275796553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9069697846.
The product of its digits is 95256000, while the sum is 61.
The spelling of 426275796553 in words is "four hundred twenty-six billion, two hundred seventy-five million, seven hundred ninety-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •