Base | Representation |
---|---|
bin | 100110111101… |
… | …011010101110 |
3 | 201012212122200 |
4 | 212331122232 |
5 | 10103304123 |
6 | 1002522330 |
7 | 152544423 |
oct | 46753256 |
9 | 21185580 |
10 | 10213038 |
11 | 5846230 |
12 | 35063a6 |
13 | 2167824 |
14 | 14dbd4a |
15 | d6b143 |
hex | 9bd6ae |
10213038 has 24 divisors (see below), whose sum is σ = 24140376. Its totient is φ = 3094800.
The previous prime is 10213031. The next prime is 10213057. The reversal of 10213038 is 83031201.
It is a super-2 number, since 2×102130382 = 208612290378888, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 10213038.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213031) 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, 25593 + ... + 25988.
It is an arithmetic number, because the mean of its divisors is an integer number (1005849).
Almost surely, 210213038 is an apocalyptic number.
10213038 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
10213038 is an abundant number, since it is smaller than the sum of its proper divisors (13927338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213038 is a wasteful number, since it uses less digits than its factorization.
10213038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51600 (or 51597 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 10213038 is about 3195.7844107511. The cubic root of 10213038 is about 216.9626529341.
Adding to 10213038 its reverse (83031201), we get a palindrome (93244239).
The spelling of 10213038 in words is "ten million, two hundred thirteen thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •