Base | Representation |
---|---|
bin | 10110000101010… |
… | …00100111010111 |
3 | 110220120011112121 |
4 | 23002220213113 |
5 | 334410140043 |
6 | 30214200411 |
7 | 4406341243 |
oct | 1302504727 |
9 | 426504477 |
10 | 185240023 |
11 | 95621631 |
12 | 52053107 |
13 | 2c4b9ca7 |
14 | 1a85d423 |
15 | 113e0ded |
hex | b0a89d7 |
185240023 has 8 divisors (see below), whose sum is σ = 191998080. Its totient is φ = 178506720.
The previous prime is 185240021. The next prime is 185240053. The reversal of 185240023 is 320042581.
185240023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 185240023 - 21 = 185240021 is a prime.
It is a super-2 number, since 2×1852400232 = 68627732242081058, which contains 22 as substring.
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 185240023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (185240021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9786 + ... + 21592.
It is an arithmetic number, because the mean of its divisors is an integer number (23999760).
Almost surely, 2185240023 is an apocalyptic number.
185240023 is a deficient number, since it is larger than the sum of its proper divisors (6758057).
185240023 is a wasteful number, since it uses less digits than its factorization.
185240023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12377.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 185240023 is about 13610.2910696282. The cubic root of 185240023 is about 570.0482394795.
The spelling of 185240023 in words is "one hundred eighty-five million, two hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •