Base | Representation |
---|---|
bin | 1011111011001111100000… |
… | …0001000101001011001111 |
3 | 1201102112101210020010122212 |
4 | 2332303320001011023033 |
5 | 3204313144203022203 |
6 | 43515430504501035 |
7 | 2522224345250210 |
oct | 276637001051317 |
9 | 51375353203585 |
10 | 13112401220303 |
11 | 41a5a357161a0 |
12 | 157933077a77b |
13 | 7416567aa528 |
14 | 3349020a5407 |
15 | 17b13c4971d8 |
hex | becf80452cf |
13112401220303 has 8 divisors (see below), whose sum is σ = 16347928794240. Its totient is φ = 10217455496280.
The previous prime is 13112401220299. The next prime is 13112401220363. The reversal of 13112401220303 is 30302210421131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13112401220303 - 22 = 13112401220299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112401220363) 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 7 ways as a sum of consecutive naturals, for example, 85145462393 + ... + 85145462546.
It is an arithmetic number, because the mean of its divisors is an integer number (2043491099280).
Almost surely, 213112401220303 is an apocalyptic number.
13112401220303 is a deficient number, since it is larger than the sum of its proper divisors (3235527573937).
13112401220303 is a wasteful number, since it uses less digits than its factorization.
13112401220303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170290924957.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13112401220303 its reverse (30302210421131), we get a palindrome (43414611641434).
The spelling of 13112401220303 in words is "thirteen trillion, one hundred twelve billion, four hundred one million, two hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •