Base | Representation |
---|---|
bin | 1011111010100001110100… |
… | …1100011110001001110111 |
3 | 1201101100202021200201111212 |
4 | 2332220131030132021313 |
5 | 3204113041323430203 |
6 | 43510042105352035 |
7 | 2521311453154031 |
oct | 276503514361167 |
9 | 51340667621455 |
10 | 13100140061303 |
11 | 41a08135a9a39 |
12 | 1576a8a49861b |
13 | 7404514c7069 |
14 | 33409b904c51 |
15 | 17ab70d3b1d8 |
hex | bea1d31e277 |
13100140061303 has 4 divisors (see below), whose sum is σ = 13100185264320. Its totient is φ = 13100094858288.
The previous prime is 13100140061279. The next prime is 13100140061347. The reversal of 13100140061303 is 30316004100131.
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 13100140061303 - 238 = 12825262154359 is a prime.
It is a super-2 number, since 2×131001400613032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100140061803) 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, 22163975 + ... + 22747352.
It is an arithmetic number, because the mean of its divisors is an integer number (3275046316080).
Almost surely, 213100140061303 is an apocalyptic number.
13100140061303 is a deficient number, since it is larger than the sum of its proper divisors (45203017).
13100140061303 is an equidigital number, since it uses as much as digits as its factorization.
13100140061303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45203016.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13100140061303 its reverse (30316004100131), we get a palindrome (43416144161434).
The spelling of 13100140061303 in words is "thirteen trillion, one hundred billion, one hundred forty million, sixty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •