Base | Representation |
---|---|
bin | 100111100010… |
… | …010101001011 |
3 | 201111120001120 |
4 | 213202111023 |
5 | 10123123420 |
6 | 1010050323 |
7 | 154044300 |
oct | 47422513 |
9 | 21446046 |
10 | 10364235 |
11 | 5939892 |
12 | 35799a3 |
13 | 21bb5ab |
14 | 153b0a7 |
15 | d9ad40 |
hex | 9e254b |
10364235 has 48 divisors (see below), whose sum is σ = 19699200. Its totient is φ = 4638144.
The previous prime is 10364231. The next prime is 10364239. The reversal of 10364235 is 53246301.
It is a happy number.
10364235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10364231) and next prime (10364239).
It is not a de Polignac number, because 10364235 - 22 = 10364231 is a prime.
It is a super-3 number, since 3×103642353 (a number of 22 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10364231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43246 + ... + 43484.
It is an arithmetic number, because the mean of its divisors is an integer number (410400).
Almost surely, 210364235 is an apocalyptic number.
10364235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10364235 is a deficient number, since it is larger than the sum of its proper divisors (9334965).
10364235 is a wasteful number, since it uses less digits than its factorization.
10364235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320 (or 313 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 10364235 is about 3219.3531959075. The cubic root of 10364235 is about 218.0280734264.
The spelling of 10364235 in words is "ten million, three hundred sixty-four thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •