Base | Representation |
---|---|
bin | 110111111000010111… |
… | …1011111111000111111 |
3 | 102110202020000010012112 |
4 | 1233300233133320333 |
5 | 3431231243201343 |
6 | 131043442524235 |
7 | 11445534343646 |
oct | 1576057377077 |
9 | 373666003175 |
10 | 120003100223 |
11 | 46990692396 |
12 | 1b31096667b |
13 | b415a31516 |
14 | 5b4591235d |
15 | 31c53b9218 |
hex | 1bf0bdfe3f |
120003100223 has 4 divisors (see below), whose sum is σ = 120047076240. Its totient is φ = 119959124208.
The previous prime is 120003100213. The next prime is 120003100241. The reversal of 120003100223 is 322001300021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322001300021 = 131 ⋅2458025191.
It is a cyclic number.
It is not a de Polignac number, because 120003100223 - 218 = 120002838079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120003100198 and 120003100207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120003100213) 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, 21983915 + ... + 21989372.
It is an arithmetic number, because the mean of its divisors is an integer number (30011769060).
Almost surely, 2120003100223 is an apocalyptic number.
120003100223 is a deficient number, since it is larger than the sum of its proper divisors (43976017).
120003100223 is an equidigital number, since it uses as much as digits as its factorization.
120003100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43976016.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 120003100223 its reverse (322001300021), we get a palindrome (442004400244).
The spelling of 120003100223 in words is "one hundred twenty billion, three million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •