Base | Representation |
---|---|
bin | 10001111010100101110… |
… | …010111001110101110101 |
3 | 11100200210102022101021201 |
4 | 101322211302321311311 |
5 | 130132334402401123 |
6 | 2341325014412501 |
7 | 154642565205433 |
oct | 21724562716565 |
9 | 4320712271251 |
10 | 1231142231413 |
11 | 43514076a526 |
12 | 17a72b061131 |
13 | 8c1334c8b83 |
14 | 43832545d53 |
15 | 22058c3d5ad |
hex | 11ea5cb9d75 |
1231142231413 has 8 divisors (see below), whose sum is σ = 1242553989600. Its totient is φ = 1219732598448.
The previous prime is 1231142231411. The next prime is 1231142231443. The reversal of 1231142231413 is 3141322411321.
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 1231142231413 - 21 = 1231142231411 is a prime.
It is a super-2 number, since 2×12311422314132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231142231411) 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, 644670 + ... + 1696432.
It is an arithmetic number, because the mean of its divisors is an integer number (155319248700).
Almost surely, 21231142231413 is an apocalyptic number.
It is an amenable number.
1231142231413 is a deficient number, since it is larger than the sum of its proper divisors (11411758187).
1231142231413 is a wasteful number, since it uses less digits than its factorization.
1231142231413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1062611.
The product of its digits is 3456, while the sum is 28.
Adding to 1231142231413 its reverse (3141322411321), we get a palindrome (4372464642734).
The spelling of 1231142231413 in words is "one trillion, two hundred thirty-one billion, one hundred forty-two million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •