Base | Representation |
---|---|
bin | 1011111100010001111000… |
… | …1110011010110010100111 |
3 | 1201111020101202101122101210 |
4 | 2333010132032122302213 |
5 | 3210111143330320403 |
6 | 43531535112322503 |
7 | 2523425100352254 |
oct | 277043616326247 |
9 | 51436352348353 |
10 | 13130222120103 |
11 | 420255009aa60 |
12 | 15808849a3433 |
13 | 74323689065a |
14 | 335712bd042b |
15 | 17b831c73b03 |
hex | bf11e39aca7 |
13130222120103 has 8 divisors (see below), whose sum is σ = 19098504902016. Its totient is φ = 7957710375800.
The previous prime is 13130222120009. The next prime is 13130222120161. The reversal of 13130222120103 is 30102122203131.
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 13130222120103 - 212 = 13130222116007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13130222120103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13130222120303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198942759363 + ... + 198942759428.
It is an arithmetic number, because the mean of its divisors is an integer number (2387313112752).
Almost surely, 213130222120103 is an apocalyptic number.
13130222120103 is a deficient number, since it is larger than the sum of its proper divisors (5968282781913).
13130222120103 is a wasteful number, since it uses less digits than its factorization.
13130222120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397885518805.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13130222120103 its reverse (30102122203131), we get a palindrome (43232344323234).
The spelling of 13130222120103 in words is "thirteen trillion, one hundred thirty billion, two hundred twenty-two million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •