Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0000111011110111111 |
3 | 101201002121201100200121 |
4 | 1220103312013132333 |
5 | 3313340014300411 |
6 | 123241505435411 |
7 | 11043342112054 |
oct | 1502366073677 |
9 | 351077640617 |
10 | 112002103231 |
11 | 435552a3987 |
12 | 1985933bb67 |
13 | a73c22c685 |
14 | 55c706902b |
15 | 2da7c73571 |
hex | 1a13d877bf |
112002103231 has 8 divisors (see below), whose sum is σ = 114446352384. Its totient is φ = 109560405240.
The previous prime is 112002103207. The next prime is 112002103237. The reversal of 112002103231 is 132301200211.
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 112002103231 - 215 = 112002070463 is a prime.
It is a super-2 number, since 2×1120021032312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002103237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 548895 + ... + 724768.
It is an arithmetic number, because the mean of its divisors is an integer number (14305794048).
Almost surely, 2112002103231 is an apocalyptic number.
112002103231 is a deficient number, since it is larger than the sum of its proper divisors (2444249153).
112002103231 is a wasteful number, since it uses less digits than its factorization.
112002103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1275581.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 112002103231 its reverse (132301200211), we get a palindrome (244303303442).
The spelling of 112002103231 in words is "one hundred twelve billion, two million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •