Base | Representation |
---|---|
bin | 10011010101111001… |
… | …00011010010001010 |
3 | 222210200200122100210 |
4 | 21222330203102022 |
5 | 132231323131100 |
6 | 4434225141550 |
7 | 515221116066 |
oct | 115274432212 |
9 | 28720618323 |
10 | 10384192650 |
11 | 44496736a7 |
12 | 201978a8b6 |
13 | c96485ac0 |
14 | 7071b0aa6 |
15 | 40b99cc50 |
hex | 26af2348a |
10384192650 has 96 divisors (see below), whose sum is σ = 28148073408. Its totient is φ = 2517926400.
The previous prime is 10384192627. The next prime is 10384192681. The reversal of 10384192650 is 5629148301.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 10384192599 and 10384192608.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 90910 + ... + 170390.
It is an arithmetic number, because the mean of its divisors is an integer number (293209098).
Almost surely, 210384192650 is an apocalyptic number.
10384192650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10384192650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14074036704).
10384192650 is an abundant number, since it is smaller than the sum of its proper divisors (17763880758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10384192650 is a wasteful number, since it uses less digits than its factorization.
10384192650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79576 (or 79571 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The spelling of 10384192650 in words is "ten billion, three hundred eighty-four million, one hundred ninety-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •