Base | Representation |
---|---|
bin | 101000110101… |
… | …010101100110 |
3 | 202010211102222 |
4 | 220311111212 |
5 | 10220013410 |
6 | 1021232342 |
7 | 156661445 |
oct | 50652546 |
9 | 22124388 |
10 | 10704230 |
11 | 6051279 |
12 | 37026b2 |
13 | 22aa284 |
14 | 15c8d5c |
15 | e16955 |
hex | a35566 |
10704230 has 8 divisors (see below), whose sum is σ = 19267632. Its totient is φ = 4281688.
The previous prime is 10704217. The next prime is 10704247. The reversal of 10704230 is 3240701.
It is a happy number.
10704230 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 super-3 number, since 3×107042303 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10704199 and 10704208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 535202 + ... + 535221.
It is an arithmetic number, because the mean of its divisors is an integer number (2408454).
Almost surely, 210704230 is an apocalyptic number.
10704230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10704230 is a deficient number, since it is larger than the sum of its proper divisors (8563402).
10704230 is a wasteful number, since it uses less digits than its factorization.
10704230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1070430.
The product of its (nonzero) digits is 168, while the sum is 17.
The square root of 10704230 is about 3271.7319572361. The cubic root of 10704230 is about 220.3865792665.
Adding to 10704230 its reverse (3240701), we get a palindrome (13944931).
The spelling of 10704230 in words is "ten million, seven hundred four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •