Base | Representation |
---|---|
bin | 100111001101… |
… | …100111001000 |
3 | 201100020122100 |
4 | 213031213020 |
5 | 10112414433 |
6 | 1004153400 |
7 | 153242001 |
oct | 47154710 |
9 | 21306570 |
10 | 10279368 |
11 | 5891050 |
12 | 3538860 |
13 | 218ba88 |
14 | 15181a8 |
15 | d80b13 |
hex | 9cd9c8 |
10279368 has 48 divisors (see below), whose sum is σ = 30373200. Its totient is φ = 3114720.
The previous prime is 10279363. The next prime is 10279387. The reversal of 10279368 is 86397201.
10279368 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 Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (10279363) 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, 5698 + ... + 7281.
It is an arithmetic number, because the mean of its divisors is an integer number (632775).
Almost surely, 210279368 is an apocalyptic number.
10279368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10279368 is an abundant number, since it is smaller than the sum of its proper divisors (20093832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10279368 is a wasteful number, since it uses less digits than its factorization.
10279368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13002 (or 12995 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 10279368 is about 3206.1453491693. The cubic root of 10279368 is about 217.4313378191.
It can be divided in two parts, 10 and 279368, that added together give a triangular number (279378 = T747).
The spelling of 10279368 in words is "ten million, two hundred seventy-nine thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •