Base | Representation |
---|---|
bin | 110111100101100111… |
… | …1011001111011101111 |
3 | 102102010101002222012221 |
4 | 1233023033121323233 |
5 | 3423434211231343 |
6 | 130501205340211 |
7 | 11424124444042 |
oct | 1571317317357 |
9 | 372111088187 |
10 | 119373930223 |
11 | 46698520689 |
12 | 1b176107667 |
13 | b345591692 |
14 | 5ac6134c59 |
15 | 318a0385ed |
hex | 1bcb3d9eef |
119373930223 has 4 divisors (see below), whose sum is σ = 119374784368. Its totient is φ = 119373076080.
The previous prime is 119373930211. The next prime is 119373930229. The reversal of 119373930223 is 322039373911.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 322039373911 = 17 ⋅18943492583.
It is a cyclic number.
It is not a de Polignac number, because 119373930223 - 25 = 119373930191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 119373930223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119373930229) 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, 163011 + ... + 515092.
It is an arithmetic number, because the mean of its divisors is an integer number (29843696092).
Almost surely, 2119373930223 is an apocalyptic number.
119373930223 is a deficient number, since it is larger than the sum of its proper divisors (854145).
119373930223 is an equidigital number, since it uses as much as digits as its factorization.
119373930223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 854144.
The product of its (nonzero) digits is 183708, while the sum is 43.
The spelling of 119373930223 in words is "one hundred nineteen billion, three hundred seventy-three million, nine hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •