Base | Representation |
---|---|
bin | 10011000110011001101… |
… | …111010100010000111100 |
3 | 11122110220110202002221011 |
4 | 103012121233110100330 |
5 | 133001042322434400 |
6 | 2442550300245004 |
7 | 163554033556264 |
oct | 23063157242074 |
9 | 4573813662834 |
10 | 1312544343100 |
11 | 4667130778a1 |
12 | 192468540764 |
13 | 96a06c6b673 |
14 | 477555c27a4 |
15 | 2422036c8ba |
hex | 13199bd443c |
1312544343100 has 36 divisors (see below), whose sum is σ = 2940099335488. Its totient is φ = 508081680000.
The previous prime is 1312544343067. The next prime is 1312544343109. The reversal of 1312544343100 is 13434452131.
It is a super-2 number, since 2×13125443431002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312544343109) 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, 211697601 + ... + 211703800.
Almost surely, 21312544343100 is an apocalyptic number.
1312544343100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1312544343100 is an abundant number, since it is smaller than the sum of its proper divisors (1627554992388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312544343100 is a wasteful number, since it uses less digits than its factorization.
1312544343100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423401446 (or 423401439 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 1312544343100 its reverse (13434452131), we get a palindrome (1325978795231).
The spelling of 1312544343100 in words is "one trillion, three hundred twelve billion, five hundred forty-four million, three hundred forty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •