Base | Representation |
---|---|
bin | 101101101110100010000… |
… | …100101111001010000111 |
3 | 102010101221002112212120211 |
4 | 231232202010233022013 |
5 | 402441003100302403 |
6 | 10403323212540251 |
7 | 443012056240354 |
oct | 55564204571207 |
9 | 12111832485524 |
10 | 3142340244103 |
11 | 1001728168955 |
12 | 42900b481687 |
13 | 19a4241b7a08 |
14 | ac13926b62b |
15 | 56b15b3606d |
hex | 2dba212f287 |
3142340244103 has 4 divisors (see below), whose sum is σ = 3307726572760. Its totient is φ = 2976953915448.
The previous prime is 3142340244097. The next prime is 3142340244119. The reversal of 3142340244103 is 3014420432413.
3142340244103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3142340244103 - 29 = 3142340243591 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3142340244143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82693164300 + ... + 82693164337.
It is an arithmetic number, because the mean of its divisors is an integer number (826931643190).
Almost surely, 23142340244103 is an apocalyptic number.
3142340244103 is a deficient number, since it is larger than the sum of its proper divisors (165386328657).
3142340244103 is a wasteful number, since it uses less digits than its factorization.
3142340244103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165386328656.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 3142340244103 its reverse (3014420432413), we get a palindrome (6156760676516).
The spelling of 3142340244103 in words is "three trillion, one hundred forty-two billion, three hundred forty million, two hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •