Base | Representation |
---|---|
bin | 10011000100000010101… |
… | …100000111001010110100 |
3 | 11122020100212012102111110 |
4 | 103010002230013022310 |
5 | 132430400044042122 |
6 | 2441451011435020 |
7 | 163434162331065 |
oct | 23040254071264 |
9 | 4566325172443 |
10 | 1310010143412 |
11 | 465632635093 |
12 | 191a7b8b5a70 |
13 | 966c1c26819 |
14 | 47594bcc56c |
15 | 24122b3890c |
hex | 13102b072b4 |
1310010143412 has 12 divisors (see below), whose sum is σ = 3056690334656. Its totient is φ = 436670047800.
The previous prime is 1310010143363. The next prime is 1310010143419. The reversal of 1310010143412 is 2143410100131.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×13100101434122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310010143419) 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, 54583755964 + ... + 54583755987.
Almost surely, 21310010143412 is an apocalyptic number.
1310010143412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1310010143412 is an abundant number, since it is smaller than the sum of its proper divisors (1746680191244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310010143412 is a wasteful number, since it uses less digits than its factorization.
1310010143412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109167511958 (or 109167511956 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1310010143412 its reverse (2143410100131), we get a palindrome (3453420243543).
The spelling of 1310010143412 in words is "one trillion, three hundred ten billion, ten million, one hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •