Base | Representation |
---|---|
bin | 100000000110011000… |
… | …0100111001110000100 |
3 | 20120221002122000020001 |
4 | 1000030300213032010 |
5 | 2112133442000014 |
6 | 51400113051044 |
7 | 4660144323616 |
oct | 1001460471604 |
9 | 216832560201 |
10 | 68933546884 |
11 | 27264210064 |
12 | 11439856a84 |
13 | 66675111c7 |
14 | 349d12adb6 |
15 | 1bd6ba4974 |
hex | 100cc27384 |
68933546884 has 12 divisors (see below), whose sum is σ = 120850288524. Its totient is φ = 34404893024.
The previous prime is 68933546881. The next prime is 68933546887. The reversal of 68933546884 is 48864533986.
It is an interprime number because it is at equal distance from previous prime (68933546881) and next prime (68933546887).
It can be written as a sum of positive squares in 2 ways, for example, as 12593777284 + 56339769600 = 112222^2 + 237360^2 .
It is a super-2 number, since 2×689335468842 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (68933546881) 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 3 ways as a sum of consecutive naturals, for example, 15467599 + ... + 15472054.
It is an arithmetic number, because the mean of its divisors is an integer number (10070857377).
Almost surely, 268933546884 is an apocalyptic number.
It is an amenable number.
68933546884 is a deficient number, since it is larger than the sum of its proper divisors (51916741640).
68933546884 is a wasteful number, since it uses less digits than its factorization.
68933546884 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30940214 (or 30940212 counting only the distinct ones).
The product of its digits is 119439360, while the sum is 64.
The spelling of 68933546884 in words is "sixty-eight billion, nine hundred thirty-three million, five hundred forty-six thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •