Base | Representation |
---|---|
bin | 10110000001010111100011… |
… | …010001000100011101101011 |
3 | 110200220212102211120112201010 |
4 | 112001113203101010131223 |
5 | 100143301402244212032 |
6 | 541552425452555003 |
7 | 26254153551531216 |
oct | 2601274321043553 |
9 | 420825384515633 |
10 | 96851030460267 |
11 | 28950322880406 |
12 | aa42466182a63 |
13 | 42070226aa3c5 |
14 | 19cb88736477d |
15 | b2e4b6b97ccc |
hex | 5815e344476b |
96851030460267 has 8 divisors (see below), whose sum is σ = 129989904017920. Its totient is φ = 64139755271400.
The previous prime is 96851030460157. The next prime is 96851030460323. The reversal of 96851030460267 is 76206403015869.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 96851030460267 - 211 = 96851030458219 is a prime.
It is a super-2 number, since 2×968510304602672 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (96851030462267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106899591667 + ... + 106899592572.
It is an arithmetic number, because the mean of its divisors is an integer number (16248738002240).
It is a 1-persistent number, because it is pandigital, but 2⋅96851030460267 = 193702060920534 is not.
Almost surely, 296851030460267 is an apocalyptic number.
96851030460267 is a deficient number, since it is larger than the sum of its proper divisors (33138873557653).
96851030460267 is a wasteful number, since it uses less digits than its factorization.
96851030460267 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213799184393.
The product of its (nonzero) digits is 13063680, while the sum is 57.
The spelling of 96851030460267 in words is "ninety-six trillion, eight hundred fifty-one billion, thirty million, four hundred sixty thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •