Base | Representation |
---|---|
bin | 10010111010101110000… |
… | …100000100000100110011 |
3 | 11121021112021011000011212 |
4 | 102322232010010010303 |
5 | 132244400102033433 |
6 | 2433113440430335 |
7 | 162631136166263 |
oct | 22725604040463 |
9 | 4537467130155 |
10 | 1300000424243 |
11 | 461366391a04 |
12 | 18bb476183ab |
13 | 95788215581 |
14 | 46cc56597a3 |
15 | 23c38eaad48 |
hex | 12eae104133 |
1300000424243 has 8 divisors (see below), whose sum is σ = 1301463189936. Its totient is φ = 1298538253600.
The previous prime is 1300000424141. The next prime is 1300000424249. The reversal of 1300000424243 is 3424240000031.
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 1300000424243 - 216 = 1300000358707 is a prime.
It is a super-2 number, since 2×13000004242432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1300000424249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4297553 + ... + 4590093.
It is an arithmetic number, because the mean of its divisors is an integer number (162682898742).
Almost surely, 21300000424243 is an apocalyptic number.
1300000424243 is a deficient number, since it is larger than the sum of its proper divisors (1462765693).
1300000424243 is a wasteful number, since it uses less digits than its factorization.
1300000424243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297525.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 1300000424243 its reverse (3424240000031), we get a palindrome (4724240424274).
The spelling of 1300000424243 in words is "one trillion, three hundred billion, four hundred twenty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •