Base | Representation |
---|---|
bin | 11101100110111011011000… |
… | …001010011101111110011011 |
3 | 122002001202120100000021211022 |
4 | 131212323120022131332123 |
5 | 114031444333421244003 |
6 | 1140541310002353055 |
7 | 36266654314353125 |
oct | 3546733012357633 |
9 | 562052510007738 |
10 | 130218445103003 |
11 | 38545372522304 |
12 | 1273125995b78b |
13 | 57877150a869a |
14 | 242286bc52215 |
15 | 100c431ee8738 |
hex | 766ed829df9b |
130218445103003 has 4 divisors (see below), whose sum is σ = 130218573469488. Its totient is φ = 130218316736520.
The previous prime is 130218445102969. The next prime is 130218445103009. The reversal of 130218445103003 is 300301544812031.
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 130218445103003 - 228 = 130218176667547 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130218445103009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62649383 + ... + 64694528.
It is an arithmetic number, because the mean of its divisors is an integer number (32554643367372).
Almost surely, 2130218445103003 is an apocalyptic number.
130218445103003 is a deficient number, since it is larger than the sum of its proper divisors (128366485).
130218445103003 is a wasteful number, since it uses less digits than its factorization.
130218445103003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128366484.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 130218445103003 its reverse (300301544812031), we get a palindrome (430519989915034).
The spelling of 130218445103003 in words is "one hundred thirty trillion, two hundred eighteen billion, four hundred forty-five million, one hundred three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •