Base | Representation |
---|---|
bin | 110111111000100101… |
… | …0010000000011000111 |
3 | 102110202201012102020021 |
4 | 1233301022100003013 |
5 | 3431240042110343 |
6 | 131044253120011 |
7 | 11445651063010 |
oct | 1576112200307 |
9 | 373681172207 |
10 | 120010113223 |
11 | 46994642360 |
12 | 1b313189007 |
13 | b417318620 |
14 | 5b4681a007 |
15 | 31c5d020ed |
hex | 1bf12900c7 |
120010113223 has 32 divisors (see below), whose sum is σ = 161345221632. Its totient is φ = 86206982400.
The previous prime is 120010113211. The next prime is 120010113233. The reversal of 120010113223 is 322311010021.
It is not a de Polignac number, because 120010113223 - 233 = 111420178631 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120010113197 and 120010113206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120010113233) 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 31 ways as a sum of consecutive naturals, for example, 682990 + ... + 840532.
It is an arithmetic number, because the mean of its divisors is an integer number (5042038176).
Almost surely, 2120010113223 is an apocalyptic number.
120010113223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
120010113223 is a deficient number, since it is larger than the sum of its proper divisors (41335108409).
120010113223 is a wasteful number, since it uses less digits than its factorization.
120010113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158335.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 120010113223 its reverse (322311010021), we get a palindrome (442321123244).
The spelling of 120010113223 in words is "one hundred twenty billion, ten million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •