Base | Representation |
---|---|
bin | 10010111011000100… |
… | …10001100000101000 |
3 | 222020000022211212122 |
4 | 21131202101200220 |
5 | 131301223402141 |
6 | 4400030530412 |
7 | 506516530520 |
oct | 113542214050 |
9 | 28200284778 |
10 | 10159200296 |
11 | 4343670603 |
12 | 1b76366a08 |
13 | c5b98ac2b |
14 | 6c5364680 |
15 | 3e6d5864b |
hex | 25d891828 |
10159200296 has 64 divisors (see below), whose sum is σ = 22377062400. Its totient is φ = 4233394368.
The previous prime is 10159200283. The next prime is 10159200299. The reversal of 10159200296 is 69200295101.
It is not an unprimeable number, because it can be changed into a prime (10159200299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 527525 + ... + 546443.
It is an arithmetic number, because the mean of its divisors is an integer number (349641600).
Almost surely, 210159200296 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10159200296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11188531200).
10159200296 is an abundant number, since it is smaller than the sum of its proper divisors (12217862104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10159200296 is a wasteful number, since it uses less digits than its factorization.
10159200296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19198 (or 19194 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 35.
Adding to 10159200296 its reverse (69200295101), we get a palindrome (79359495397).
The spelling of 10159200296 in words is "ten billion, one hundred fifty-nine million, two hundred thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •