Base | Representation |
---|---|
bin | 11101110011101… |
… | …00111110011111 |
3 | 122102111100201000 |
4 | 32321310332133 |
5 | 1003002241343 |
6 | 40451121343 |
7 | 6124210146 |
oct | 1671647637 |
9 | 572440630 |
10 | 250040223 |
11 | 119160a14 |
12 | 6b8a3253 |
13 | 3ca57ac4 |
14 | 252ca75d |
15 | 16e40ed3 |
hex | ee74f9f |
250040223 has 16 divisors (see below), whose sum is σ = 373832800. Its totient is φ = 165162240.
The previous prime is 250040213. The next prime is 250040243. The reversal of 250040223 is 322040052.
It is not a de Polignac number, because 250040223 - 210 = 250039199 is a prime.
It is a super-2 number, since 2×2500402232 = 125040226235779458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 250040196 and 250040205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250040213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39538 + ... + 45423.
It is an arithmetic number, because the mean of its divisors is an integer number (23364550).
Almost surely, 2250040223 is an apocalyptic number.
250040223 is a deficient number, since it is larger than the sum of its proper divisors (123792577).
250040223 is a wasteful number, since it uses less digits than its factorization.
250040223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85079 (or 85073 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 18.
The square root of 250040223 is about 15812.6602126271. The cubic root of 250040223 is about 629.9943083386.
Adding to 250040223 its product of nonzero digits (480), we get a triangular number (250040703 = T22362).
Adding to 250040223 its reverse (322040052), we get a palindrome (572080275).
The spelling of 250040223 in words is "two hundred fifty million, forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •