Base | Representation |
---|---|
bin | 10010000101110000100… |
… | …000100110101111011110 |
3 | 11101211202002022212002102 |
4 | 102011300200212233132 |
5 | 130331414041102110 |
6 | 2351030521325102 |
7 | 155545666243361 |
oct | 22056040465736 |
9 | 4354662285072 |
10 | 1243133144030 |
11 | 43a234284668 |
12 | 180b16936792 |
13 | 902c47cb33b |
14 | 4424cc7a0d8 |
15 | 2250b7b65a5 |
hex | 12170826bde |
1243133144030 has 16 divisors (see below), whose sum is σ = 2238891868080. Its totient is φ = 496974988992.
The previous prime is 1243133144021. The next prime is 1243133144063. The reversal of 1243133144030 is 304413313421.
It is a happy number.
It is a super-3 number, since 3×12431331440303 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1243133143984 and 1243133144002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34764815 + ... + 34800554.
It is an arithmetic number, because the mean of its divisors is an integer number (139930741755).
Almost surely, 21243133144030 is an apocalyptic number.
1243133144030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1243133144030 is a deficient number, since it is larger than the sum of its proper divisors (995758724050).
1243133144030 is a wasteful number, since it uses less digits than its factorization.
1243133144030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69567163.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1243133144030 its reverse (304413313421), we get a palindrome (1547546457451).
The spelling of 1243133144030 in words is "one trillion, two hundred forty-three billion, one hundred thirty-three million, one hundred forty-four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •