Base | Representation |
---|---|
bin | 10011100101011111011… |
… | …111010101010101001111 |
3 | 11202200001221202021201111 |
4 | 103211133133111111033 |
5 | 134022424231004012 |
6 | 2510151002352451 |
7 | 166145215101400 |
oct | 23453737252517 |
9 | 4680057667644 |
10 | 1345926813007 |
11 | 4798936635a7 |
12 | 198a241bb727 |
13 | 99bc702c43a |
14 | 49200d539a7 |
15 | 25025dd9ba7 |
hex | 1395f7d554f |
1345926813007 has 12 divisors (see below), whose sum is σ = 1657768200480. Its totient is φ = 1085789697216.
The previous prime is 1345926812959. The next prime is 1345926813013. The reversal of 1345926813007 is 7003186295431.
It is not a de Polignac number, because 1345926813007 - 235 = 1311567074639 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345926814007) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 807878407 + ... + 807880072.
It is an arithmetic number, because the mean of its divisors is an integer number (138147350040).
It is a 1-persistent number, because it is pandigital, but 2⋅1345926813007 = 2691853626014 is not.
Almost surely, 21345926813007 is an apocalyptic number.
1345926813007 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1345926813007 is a deficient number, since it is larger than the sum of its proper divisors (311841387473).
1345926813007 is a wasteful number, since it uses less digits than its factorization.
1345926813007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1615758510 (or 1615758503 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 1345926813007 in words is "one trillion, three hundred forty-five billion, nine hundred twenty-six million, eight hundred thirteen thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •