Base | Representation |
---|---|
bin | 101011110000100100… |
… | …1100100000000000000 |
3 | 22222120001022122110010 |
4 | 1113201021210000000 |
5 | 3014423223143233 |
6 | 111100415304520 |
7 | 6534464134044 |
oct | 1274111440000 |
9 | 288501278403 |
10 | 93971693568 |
11 | 36942631275 |
12 | 16266b1b140 |
13 | 8b2791280c |
14 | 47965a4024 |
15 | 269edaeb63 |
hex | 15e1264000 |
93971693568 has 120 divisors (see below), whose sum is σ = 251087491872. Its totient is φ = 31260934144.
The previous prime is 93971693549. The next prime is 93971693591. The reversal of 93971693568 is 86539617939.
It is a junction number, because it is equal to n+sod(n) for n = 93971693499 and 93971693508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28850596 + ... + 28853852.
Almost surely, 293971693568 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 93971693568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125543745936).
93971693568 is an abundant number, since it is smaller than the sum of its proper divisors (157115798304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
93971693568 is an equidigital number, since it uses as much as digits as its factorization.
93971693568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3875 (or 3849 counting only the distinct ones).
The product of its digits is 66134880, while the sum is 66.
The spelling of 93971693568 in words is "ninety-three billion, nine hundred seventy-one million, six hundred ninety-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •