Base | Representation |
---|---|
bin | 1100000110110100001010… |
… | …1011110110000101111011 |
3 | 1202010112120222102121000012 |
4 | 3001231002223312011323 |
5 | 3221042340421042230 |
6 | 44151031405332135 |
7 | 2542463333605652 |
oct | 301550253660573 |
9 | 52115528377005 |
10 | 13311222440315 |
11 | 4272292054558 |
12 | 15ab97956704b |
13 | 757320824a47 |
14 | 3403a37bc199 |
15 | 1813c71c3395 |
hex | c1b42af617b |
13311222440315 has 4 divisors (see below), whose sum is σ = 15973466928384. Its totient is φ = 10648977952248.
The previous prime is 13311222440311. The next prime is 13311222440323. The reversal of 13311222440315 is 51304422211331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13311222440315 - 22 = 13311222440311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13311222440311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1331122244027 + ... + 1331122244036.
It is an arithmetic number, because the mean of its divisors is an integer number (3993366732096).
Almost surely, 213311222440315 is an apocalyptic number.
13311222440315 is a deficient number, since it is larger than the sum of its proper divisors (2662244488069).
13311222440315 is an equidigital number, since it uses as much as digits as its factorization.
13311222440315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2662244488068.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 13311222440315 its reverse (51304422211331), we get a palindrome (64615644651646).
The spelling of 13311222440315 in words is "thirteen trillion, three hundred eleven billion, two hundred twenty-two million, four hundred forty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •