Base | Representation |
---|---|
bin | 10000011100011001111… |
… | …101101100101011000101 |
3 | 11000000202110221111010220 |
4 | 100130121331230223011 |
5 | 122003231033044023 |
6 | 2223041554534553 |
7 | 144432515354415 |
oct | 20343175545305 |
9 | 4000673844126 |
10 | 1130012003013 |
11 | 3a6265353073 |
12 | 163006897459 |
13 | 827377b383a |
14 | 3c99b358645 |
15 | 1e5da69b3e3 |
hex | 10719f6cac5 |
1130012003013 has 4 divisors (see below), whose sum is σ = 1506682670688. Its totient is φ = 753341335340.
The previous prime is 1130012002969. The next prime is 1130012003023. The reversal of 1130012003013 is 3103002100311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1130012003013 - 26 = 1130012002949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1130012002983 and 1130012003001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130012003023) 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, 188335333833 + ... + 188335333838.
It is an arithmetic number, because the mean of its divisors is an integer number (376670667672).
Almost surely, 21130012003013 is an apocalyptic number.
It is an amenable number.
1130012003013 is a deficient number, since it is larger than the sum of its proper divisors (376670667675).
1130012003013 is an equidigital number, since it uses as much as digits as its factorization.
1130012003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376670667674.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1130012003013 its reverse (3103002100311), we get a palindrome (4233014103324).
The spelling of 1130012003013 in words is "one trillion, one hundred thirty billion, twelve million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •