Base | Representation |
---|---|
bin | 100111011101… |
… | …010000110000 |
3 | 201110111120120 |
4 | 213131100300 |
5 | 10121442342 |
6 | 1005410240 |
7 | 153626616 |
oct | 47352060 |
9 | 21414516 |
10 | 10343472 |
11 | 5925227 |
12 | 3569980 |
13 | 21b1cc9 |
14 | 15336b6 |
15 | d94aec |
hex | 9dd430 |
10343472 has 40 divisors (see below), whose sum is σ = 26865840. Its totient is φ = 3429120.
The previous prime is 10343471. The next prime is 10343503. The reversal of 10343472 is 27434301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an alternating number because its digits alternate between odd and even.
It is not an unprimeable number, because it can be changed into a prime (10343471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10522 + ... + 11462.
It is an arithmetic number, because the mean of its divisors is an integer number (671646).
Almost surely, 210343472 is an apocalyptic number.
10343472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10343472 is an abundant number, since it is smaller than the sum of its proper divisors (16522368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10343472 is a wasteful number, since it uses less digits than its factorization.
10343472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181 (or 1175 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 24.
The square root of 10343472 is about 3216.1268631694. The cubic root of 10343472 is about 217.8823819136.
Adding to 10343472 its reverse (27434301), we get a palindrome (37777773).
The spelling of 10343472 in words is "ten million, three hundred forty-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •