Base | Representation |
---|---|
bin | 101001000100001110011… |
… | …0111100000000110100001 |
3 | 201222120100000222010202001 |
4 | 1102020130313200012201 |
5 | 1214433024230312101 |
6 | 20000503420324001 |
7 | 1121525230544206 |
oct | 122103467400641 |
9 | 21876300863661 |
10 | 5644071338401 |
11 | 1886701147981 |
12 | 771a380a3601 |
13 | 31c3064124b2 |
14 | 157262bdbcad |
15 | 9bc366dd901 |
hex | 5221cde01a1 |
5644071338401 has 4 divisors (see below), whose sum is σ = 5644136091204. Its totient is φ = 5644006585600.
The previous prime is 5644071338309. The next prime is 5644071338413. The reversal of 5644071338401 is 1048331704465.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5608868573025 + 35202765376 = 2368305^2 + 187624^2 .
It is a cyclic number.
It is not a de Polignac number, because 5644071338401 - 29 = 5644071337889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5644071338461) 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, 32245480 + ... + 32420041.
It is an arithmetic number, because the mean of its divisors is an integer number (1411034022801).
Almost surely, 25644071338401 is an apocalyptic number.
It is an amenable number.
5644071338401 is a deficient number, since it is larger than the sum of its proper divisors (64752803).
5644071338401 is an equidigital number, since it uses as much as digits as its factorization.
5644071338401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64752802.
The product of its (nonzero) digits is 967680, while the sum is 46.
The spelling of 5644071338401 in words is "five trillion, six hundred forty-four billion, seventy-one million, three hundred thirty-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.410 sec. • engine limits •