Base | Representation |
---|---|
bin | 101000001011… |
… | …001001011110 |
3 | 201211001101200 |
4 | 220023021132 |
5 | 10144001142 |
6 | 1013420330 |
7 | 155341566 |
oct | 50131136 |
9 | 21731350 |
10 | 10531422 |
11 | 5a43460 |
12 | 363a6a6 |
13 | 2249715 |
14 | 1581da6 |
15 | dd064c |
hex | a0b25e |
10531422 has 24 divisors (see below), whose sum is σ = 24892920. Its totient is φ = 3191280.
The previous prime is 10531373. The next prime is 10531429. The reversal of 10531422 is 22413501.
It is a super-2 number, since 2×105314222 = 221821698684168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10531395 and 10531404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10531429) 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 11 ways as a sum of consecutive naturals, for example, 26397 + ... + 26792.
It is an arithmetic number, because the mean of its divisors is an integer number (1037205).
Almost surely, 210531422 is an apocalyptic number.
10531422 is an abundant number, since it is smaller than the sum of its proper divisors (14361498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10531422 is a wasteful number, since it uses less digits than its factorization.
10531422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53208 (or 53205 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 10531422 is about 3245.2152470984. The cubic root of 10531422 is about 219.1941731939.
Adding to 10531422 its reverse (22413501), we get a palindrome (32944923).
The spelling of 10531422 in words is "ten million, five hundred thirty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •