Base | Representation |
---|---|
bin | 10011000100011011110… |
… | …101011100101010010101 |
3 | 11122021110021001000221112 |
4 | 103010123311130222111 |
5 | 132432231044134031 |
6 | 2442000522024405 |
7 | 163450504252235 |
oct | 23043365345225 |
9 | 4567407030845 |
10 | 1310432021141 |
11 | 465829793071 |
12 | 191b79048105 |
13 | 9675b458109 |
14 | 475d4c49cc5 |
15 | 24149bbe62b |
hex | 1311bd5ca95 |
1310432021141 has 8 divisors (see below), whose sum is σ = 1367721849600. Its totient is φ = 1253168402992.
The previous prime is 1310432021113. The next prime is 1310432021147. The reversal of 1310432021141 is 1411202340131.
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 1310432021141 - 214 = 1310432004757 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310432021147) 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, 6450365 + ... + 6650418.
It is an arithmetic number, because the mean of its divisors is an integer number (170965231200).
Almost surely, 21310432021141 is an apocalyptic number.
It is an amenable number.
1310432021141 is a deficient number, since it is larger than the sum of its proper divisors (57289828459).
1310432021141 is a wasteful number, since it uses less digits than its factorization.
1310432021141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13105155.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1310432021141 its reverse (1411202340131), we get a palindrome (2721634361272).
The spelling of 1310432021141 in words is "one trillion, three hundred ten billion, four hundred thirty-two million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •