Base | Representation |
---|---|
bin | 10011000101010110110… |
… | …100011001000100101110 |
3 | 11122101000020002212000002 |
4 | 103011112310121010232 |
5 | 132441242412200141 |
6 | 2442243032104302 |
7 | 163514151451025 |
oct | 23052664310456 |
9 | 4571006085002 |
10 | 1311421600046 |
11 | 466197339378 |
12 | 1921b4535092 |
13 | 96888486b6c |
14 | 4768a4438bc |
15 | 241a69e2e9b |
hex | 13156d1912e |
1311421600046 has 8 divisors (see below), whose sum is σ = 1969231797120. Its totient is φ = 655011001008.
The previous prime is 1311421600043. The next prime is 1311421600061. The reversal of 1311421600046 is 6400061241131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13114216000462 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1311421599991 and 1311421600018.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311421600043) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 349897166 + ... + 349900913.
It is an arithmetic number, because the mean of its divisors is an integer number (246153974640).
Almost surely, 21311421600046 is an apocalyptic number.
1311421600046 is a deficient number, since it is larger than the sum of its proper divisors (657810197074).
1311421600046 is an equidigital number, since it uses as much as digits as its factorization.
1311421600046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 699799018.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 1311421600046 its reverse (6400061241131), we get a palindrome (7711482841177).
The spelling of 1311421600046 in words is "one trillion, three hundred eleven billion, four hundred twenty-one million, six hundred thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •