Base | Representation |
---|---|
bin | 1011111100010010010000… |
… | …0100101001010001110111 |
3 | 1201111020122120222200221120 |
4 | 2333010210010221101313 |
5 | 3210111343434040203 |
6 | 43531552535115023 |
7 | 2523430401245505 |
oct | 277044404512167 |
9 | 51436576880846 |
10 | 13130320221303 |
11 | 42025a050492a |
12 | 15808b1812a73 |
13 | 743250cbaabc |
14 | 335721c49675 |
15 | 17b83a6a0b53 |
hex | bf124129477 |
13130320221303 has 4 divisors (see below), whose sum is σ = 17507093628408. Its totient is φ = 8753546814200.
The previous prime is 13130320221191. The next prime is 13130320221313. The reversal of 13130320221303 is 30312202303131.
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 13130320221303 - 29 = 13130320220791 is a prime.
It is a super-2 number, since 2×131303202213032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13130320221313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2188386703548 + ... + 2188386703553.
It is an arithmetic number, because the mean of its divisors is an integer number (4376773407102).
Almost surely, 213130320221303 is an apocalyptic number.
13130320221303 is a deficient number, since it is larger than the sum of its proper divisors (4376773407105).
13130320221303 is an equidigital number, since it uses as much as digits as its factorization.
13130320221303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4376773407104.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 13130320221303 its reverse (30312202303131), we get a palindrome (43442522524434).
The spelling of 13130320221303 in words is "thirteen trillion, one hundred thirty billion, three hundred twenty million, two hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •