Base | Representation |
---|---|
bin | 10011000100011011110… |
… | …101110101000100101011 |
3 | 11122021110021020010002212 |
4 | 103010123311311010223 |
5 | 132432231110334011 |
6 | 2442000524115335 |
7 | 163450505146610 |
oct | 23043365650453 |
9 | 4567407203085 |
10 | 1310432121131 |
11 | 465829851201 |
12 | 191b79095b4b |
13 | 9675b491793 |
14 | 475d4c74507 |
15 | 24149bde08b |
hex | 1311bd7512b |
1310432121131 has 16 divisors (see below), whose sum is σ = 1520849155584. Its totient is φ = 1105872865344.
The previous prime is 1310432121041. The next prime is 1310432121137. The reversal of 1310432121131 is 1311212340131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1310432121131 is a prime.
It is a super-2 number, since 2×13104321211312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310432121097 and 1310432121106.
It is not an unprimeable number, because it can be changed into a prime (1310432121137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1989791 + ... + 2565176.
It is an arithmetic number, because the mean of its divisors is an integer number (95053072224).
Almost surely, 21310432121131 is an apocalyptic number.
1310432121131 is a deficient number, since it is larger than the sum of its proper divisors (210417034453).
1310432121131 is an equidigital number, since it uses as much as digits as its factorization.
1310432121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4555610.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 1310432121131 its reverse (1311212340131), we get a palindrome (2621644461262).
The spelling of 1310432121131 in words is "one trillion, three hundred ten billion, four hundred thirty-two million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •