Base | Representation |
---|---|
bin | 1100000110010011011101… |
… | …0001110100000001001111 |
3 | 1202002200220222211220202000 |
4 | 3001210313101310001033 |
5 | 3220421344412211421 |
6 | 44143020155403343 |
7 | 2542032614662215 |
oct | 301446721640117 |
9 | 52080828756660 |
10 | 13302441132111 |
11 | 426959625274a |
12 | 15aa128753553 |
13 | 7565514748a1 |
14 | 33dbad452cb5 |
15 | 1810612e4226 |
hex | c193747404f |
13302441132111 has 128 divisors (see below), whose sum is σ = 21596833785600. Its totient is φ = 8058215301120.
The previous prime is 13302441132107. The next prime is 13302441132161. The reversal of 13302441132111 is 11123114420331.
13302441132111 is a `hidden beast` number, since 1 + 3 + 3 + 0 + 2 + 441 + 1 + 3 + 211 + 1 = 666.
It is not a de Polignac number, because 13302441132111 - 22 = 13302441132107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13302441132161) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1589485735 + ... + 1589494103.
It is an arithmetic number, because the mean of its divisors is an integer number (168725263950).
Almost surely, 213302441132111 is an apocalyptic number.
13302441132111 is a deficient number, since it is larger than the sum of its proper divisors (8294392653489).
13302441132111 is a wasteful number, since it uses less digits than its factorization.
13302441132111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9146 (or 9140 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 13302441132111 its reverse (11123114420331), we get a palindrome (24425555552442).
The spelling of 13302441132111 in words is "thirteen trillion, three hundred two billion, four hundred forty-one million, one hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •