Base | Representation |
---|---|
bin | 10111011100011110101010… |
… | …101111000100101111110000 |
3 | 111112002102110121221122022222 |
4 | 113130132222233010233300 |
5 | 102003342132422421000 |
6 | 1003145022024420212 |
7 | 30501415026444623 |
oct | 2734365257045760 |
9 | 445072417848288 |
10 | 103112144342000 |
11 | 2a944684397932 |
12 | b6939a8617668 |
13 | 456c5834b7861 |
14 | 1b669239dbdba |
15 | bdc2b44d1a85 |
hex | 5dc7aabc4bf0 |
103112144342000 has 80 divisors (see below), whose sum is σ = 253412463105984. Its totient is φ = 40568712480000.
The previous prime is 103112144341991. The next prime is 103112144342047. The reversal of 103112144342000 is 243441211301.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1031121443420002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 422468756 + ... + 422712755.
Almost surely, 2103112144342000 is an apocalyptic number.
103112144342000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103112144342000 is an abundant number, since it is smaller than the sum of its proper divisors (150300318763984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103112144342000 is an equidigital number, since it uses as much as digits as its factorization.
103112144342000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845181595 (or 845181579 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 103112144342000 its reverse (243441211301), we get a palindrome (103355585553301).
The spelling of 103112144342000 in words is "one hundred three trillion, one hundred twelve billion, one hundred forty-four million, three hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •