Base | Representation |
---|---|
bin | 10000010110000011111… |
… | …100011001011010111000 |
3 | 10222101011202011120210201 |
4 | 100112003330121122320 |
5 | 121400303212043222 |
6 | 2215554020251544 |
7 | 144101642266645 |
oct | 20260374313270 |
9 | 3871152146721 |
10 | 1123200112312 |
11 | 3a338a1aa833 |
12 | 161825540bb4 |
13 | 81bc0460895 |
14 | 3c5127a6dcc |
15 | 1e33c63d427 |
hex | 10583f196b8 |
1123200112312 has 8 divisors (see below), whose sum is σ = 2106000210600. Its totient is φ = 561600056152.
The previous prime is 1123200112289. The next prime is 1123200112313. The reversal of 1123200112312 is 2132110023211.
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 1123200112312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123200112313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70200007012 + ... + 70200007027.
It is an arithmetic number, because the mean of its divisors is an integer number (263250026325).
Almost surely, 21123200112312 is an apocalyptic number.
It is an amenable number.
1123200112312 is a deficient number, since it is larger than the sum of its proper divisors (982800098288).
1123200112312 is a wasteful number, since it uses less digits than its factorization.
1123200112312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140400014045 (or 140400014041 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1123200112312 its reverse (2132110023211), we get a palindrome (3255310135523).
The spelling of 1123200112312 in words is "one trillion, one hundred twenty-three billion, two hundred million, one hundred twelve thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •