Base | Representation |
---|---|
bin | 1011111110001100100110… |
… | …1011100001111101010100 |
3 | 1201121101102111021101211012 |
4 | 2333203021223201331110 |
5 | 3211131124314123034 |
6 | 43555023535031352 |
7 | 2526002314010660 |
oct | 277431153417524 |
9 | 51541374241735 |
10 | 13163163426644 |
11 | 4215514656140 |
12 | 158713896b558 |
13 | 74638642990a |
14 | 337159b238a0 |
15 | 17c60dbeacce |
hex | bf8c9ae1f54 |
13163163426644 has 24 divisors (see below), whose sum is σ = 28719629295168. Its totient is φ = 5128505231040.
The previous prime is 13163163426629. The next prime is 13163163426649. The reversal of 13163163426644 is 44662436136131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13163163426592 and 13163163426601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13163163426649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21368771489 + ... + 21368772104.
It is an arithmetic number, because the mean of its divisors is an integer number (1196651220632).
Almost surely, 213163163426644 is an apocalyptic number.
13163163426644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13163163426644 is an abundant number, since it is smaller than the sum of its proper divisors (15556465868524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13163163426644 is a wasteful number, since it uses less digits than its factorization.
13163163426644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42737543615 (or 42737543613 counting only the distinct ones).
The product of its digits is 4478976, while the sum is 50.
The spelling of 13163163426644 in words is "thirteen trillion, one hundred sixty-three billion, one hundred sixty-three million, four hundred twenty-six thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •