Base | Representation |
---|---|
bin | 10000011100101011101… |
… | …111100111110101111101 |
3 | 11000001112021020200221022 |
4 | 100130223233213311331 |
5 | 122004333414144401 |
6 | 2223131332313525 |
7 | 144443100024110 |
oct | 20345357476575 |
9 | 4001467220838 |
10 | 1130310303101 |
11 | 3a63a8776371 |
12 | 16308a7728a5 |
13 | 82784537975 |
14 | 3c9c8c08577 |
15 | 1e60697171b |
hex | 1072bbe7d7d |
1130310303101 has 8 divisors (see below), whose sum is σ = 1291791437184. Its totient is φ = 968831227440.
The previous prime is 1130310303097. The next prime is 1130310303127. The reversal of 1130310303101 is 1013030130311.
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 1130310303101 - 22 = 1130310303097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1130310303101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130310303131) 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, 933896 + ... + 1769966.
It is an arithmetic number, because the mean of its divisors is an integer number (161473929648).
Almost surely, 21130310303101 is an apocalyptic number.
It is an amenable number.
1130310303101 is a deficient number, since it is larger than the sum of its proper divisors (161481134083).
1130310303101 is an equidigital number, since it uses as much as digits as its factorization.
1130310303101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1029211.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1130310303101 its reverse (1013030130311), we get a palindrome (2143340433412).
The spelling of 1130310303101 in words is "one trillion, one hundred thirty billion, three hundred ten million, three hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •