Base | Representation |
---|---|
bin | 10010111010001101… |
… | …00100011111110110 |
3 | 222012111122212221010 |
4 | 21131012210133312 |
5 | 131242344004123 |
6 | 4355211133050 |
7 | 506401022664 |
oct | 113506443766 |
9 | 28174585833 |
10 | 10151938038 |
11 | 433a560340 |
12 | 1b73a44186 |
13 | c5a317538 |
14 | 6c43d3c34 |
15 | 3e63c1993 |
hex | 25d1a47f6 |
10151938038 has 64 divisors (see below), whose sum is σ = 22470877440. Its totient is φ = 3032016000.
The previous prime is 10151938033. The next prime is 10151938039. The reversal of 10151938038 is 83083915101.
It is a junction number, because it is equal to n+sod(n) for n = 10151937987 and 10151938005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10151938033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1509828 + ... + 1516536.
It is an arithmetic number, because the mean of its divisors is an integer number (351107460).
Almost surely, 210151938038 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10151938038, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11235438720).
10151938038 is an abundant number, since it is smaller than the sum of its proper divisors (12318939402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151938038 is a wasteful number, since it uses less digits than its factorization.
10151938038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7053.
The product of its (nonzero) digits is 25920, while the sum is 39.
The spelling of 10151938038 in words is "ten billion, one hundred fifty-one million, nine hundred thirty-eight thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •