Base | Representation |
---|---|
bin | 101011101000010011… |
… | …1100011110111101001 |
3 | 22221211201102212022010 |
4 | 1113100213203313221 |
5 | 3013341223012211 |
6 | 111013110550133 |
7 | 6524555534520 |
oct | 1272047436751 |
9 | 287751385263 |
10 | 93694344681 |
11 | 36810018a13 |
12 | 161aa068349 |
13 | 8ab2315a52 |
14 | 476b8094b7 |
15 | 26858774a6 |
hex | 15d09e3de9 |
93694344681 has 32 divisors (see below), whose sum is σ = 150703206400. Its totient is φ = 50721672528.
The previous prime is 93694344671. The next prime is 93694344691. The reversal of 93694344681 is 18644349639.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (93694344671) and next prime (93694344691).
It is not a de Polignac number, because 93694344681 - 231 = 91546861033 is a prime.
It is a super-2 number, since 2×936943446812 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (93694344661) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 181201 + ... + 469278.
It is an arithmetic number, because the mean of its divisors is an integer number (4709475200).
Almost surely, 293694344681 is an apocalyptic number.
It is an amenable number.
93694344681 is a deficient number, since it is larger than the sum of its proper divisors (57008861719).
93694344681 is an equidigital number, since it uses as much as digits as its factorization.
93694344681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 650546 (or 650508 counting only the distinct ones).
The product of its digits is 13436928, while the sum is 57.
The spelling of 93694344681 in words is "ninety-three billion, six hundred ninety-four million, three hundred forty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •