Base | Representation |
---|---|
bin | 110100001100111011… |
… | …1000001000011010011 |
3 | 101201100122120120020000 |
4 | 1220121313001003103 |
5 | 3314041332033243 |
6 | 123255512221043 |
7 | 11046005540364 |
oct | 1503167010323 |
9 | 351318516200 |
10 | 112103002323 |
11 | 435a7249964 |
12 | 1988709a783 |
13 | a7570c9490 |
14 | 55d6611b6b |
15 | 2db1a545d3 |
hex | 1a19dc10d3 |
112103002323 has 40 divisors (see below), whose sum is σ = 189836077200. Its totient is φ = 65355584832.
The previous prime is 112103002283. The next prime is 112103002327. The reversal of 112103002323 is 323200301211.
It is not a de Polignac number, because 112103002323 - 26 = 112103002259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112103002296 and 112103002305.
It is not an unprimeable number, because it can be changed into a prime (112103002327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2781588 + ... + 2821601.
It is an arithmetic number, because the mean of its divisors is an integer number (4745901930).
Almost surely, 2112103002323 is an apocalyptic number.
112103002323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
112103002323 is a deficient number, since it is larger than the sum of its proper divisors (77733074877).
112103002323 is a wasteful number, since it uses less digits than its factorization.
112103002323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5603233 (or 5603224 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 112103002323 its reverse (323200301211), we get a palindrome (435303303534).
The spelling of 112103002323 in words is "one hundred twelve billion, one hundred three million, two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •