Base | Representation |
---|---|
bin | 1011111011101101000101… |
… | …1101100100010100111111 |
3 | 1201110021220100112221211000 |
4 | 2332323101131210110333 |
5 | 3204430431120423403 |
6 | 43523223012501343 |
7 | 2522625235355301 |
oct | 276732135442477 |
9 | 51407810487730 |
10 | 13120344311103 |
11 | 41a9341353947 |
12 | 157a98891a853 |
13 | 7423212b6463 |
14 | 335056d97971 |
15 | 17b4549a07a3 |
hex | beed176453f |
13120344311103 has 32 divisors (see below), whose sum is σ = 19514897438400. Its totient is φ = 8712111817728.
The previous prime is 13120344311033. The next prime is 13120344311117. The reversal of 13120344311103 is 30111344302131.
13120344311103 is a `hidden beast` number, since 1 + 3 + 1 + 2 + 0 + 344 + 311 + 1 + 0 + 3 = 666.
It is not a de Polignac number, because 13120344311103 - 220 = 13120343262527 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 (13120344321103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20088775 + ... + 20731607.
It is an arithmetic number, because the mean of its divisors is an integer number (609840544950).
Almost surely, 213120344311103 is an apocalyptic number.
13120344311103 is a deficient number, since it is larger than the sum of its proper divisors (6394553127297).
13120344311103 is a wasteful number, since it uses less digits than its factorization.
13120344311103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645848 (or 645842 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 13120344311103 its reverse (30111344302131), we get a palindrome (43231688613234).
The spelling of 13120344311103 in words is "thirteen trillion, one hundred twenty billion, three hundred forty-four million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •