Base | Representation |
---|---|
bin | 101100111011111001… |
… | …1000011000110010100 |
3 | 100020002012011210120222 |
4 | 1121313303003012110 |
5 | 3040112240320002 |
6 | 112155303413512 |
7 | 6654224152250 |
oct | 1316763030624 |
9 | 306065153528 |
10 | 96499151252 |
11 | 37a1a289679 |
12 | 16851454298 |
13 | 913b4369ca |
14 | 4956121260 |
15 | 279bc111a2 |
hex | 1677cc3194 |
96499151252 has 24 divisors (see below), whose sum is σ = 193026946560. Its totient is φ = 41350641120.
The previous prime is 96499151251. The next prime is 96499151261. The reversal of 96499151252 is 25215199469.
It is a junction number, because it is equal to n+sod(n) for n = 96499151194 and 96499151203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96499151251) 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 7 ways as a sum of consecutive naturals, for example, 61124 + ... + 443547.
It is an arithmetic number, because the mean of its divisors is an integer number (8042789440).
Almost surely, 296499151252 is an apocalyptic number.
It is an amenable number.
96499151252 is an abundant number, since it is smaller than the sum of its proper divisors (96527795308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96499151252 is a wasteful number, since it uses less digits than its factorization.
96499151252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511511 (or 511509 counting only the distinct ones).
The product of its digits is 1749600, while the sum is 53.
The spelling of 96499151252 in words is "ninety-six billion, four hundred ninety-nine million, one hundred fifty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •