Base | Representation |
---|---|
bin | 11101100011111011010011… |
… | …000111111001000011100011 |
3 | 122001100001012220102202120101 |
4 | 131203323103013321003203 |
5 | 114020104442220024303 |
6 | 1140302440415323231 |
7 | 36246033366014626 |
oct | 3543732307710343 |
9 | 561301186382511 |
10 | 130012202111203 |
11 | 38475957753a55 |
12 | 126b929b520517 |
13 | 5771137562c29 |
14 | 24168a498bdbd |
15 | 1006db093dd1d |
hex | 763ed31f90e3 |
130012202111203 has 8 divisors (see below), whose sum is σ = 138587290726400. Its totient is φ = 121610347609608.
The previous prime is 130012202111179. The next prime is 130012202111213. The reversal of 130012202111203 is 302111202210031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130012202111203 - 213 = 130012202103011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130012202111213) 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, 43308526851 + ... + 43308529852.
It is an arithmetic number, because the mean of its divisors is an integer number (17323411340800).
Almost surely, 2130012202111203 is an apocalyptic number.
130012202111203 is a deficient number, since it is larger than the sum of its proper divisors (8575088615197).
130012202111203 is an equidigital number, since it uses as much as digits as its factorization.
130012202111203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86617056801.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 130012202111203 its reverse (302111202210031), we get a palindrome (432123404321234).
The spelling of 130012202111203 in words is "one hundred thirty trillion, twelve billion, two hundred two million, one hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •