Base | Representation |
---|---|
bin | 100111000001… |
… | …101101110010 |
3 | 201020202210200 |
4 | 213001231302 |
5 | 10104340032 |
6 | 1003140030 |
7 | 152646642 |
oct | 47015562 |
9 | 21222720 |
10 | 10230642 |
11 | 5858484 |
12 | 3514616 |
13 | 2172846 |
14 | 1504522 |
15 | d7147c |
hex | 9c1b72 |
10230642 has 24 divisors (see below), whose sum is σ = 22233744. Its totient is φ = 3399864.
The previous prime is 10230641. The next prime is 10230667. The reversal of 10230642 is 24603201.
It is a happy number.
10230642 is a `hidden beast` number, since 1 + 0 + 23 + 0 + 642 = 666.
10230642 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×102306423 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10230641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7333 + ... + 8615.
It is an arithmetic number, because the mean of its divisors is an integer number (926406).
Almost surely, 210230642 is an apocalyptic number.
10230642 is an abundant number, since it is smaller than the sum of its proper divisors (12003102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10230642 is a wasteful number, since it uses less digits than its factorization.
10230642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1734 (or 1731 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 10230642 is about 3198.5374782860. The cubic root of 10230642 is about 217.0872393748.
Adding to 10230642 its reverse (24603201), we get a palindrome (34833843).
The spelling of 10230642 in words is "ten million, two hundred thirty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •