Base | Representation |
---|---|
bin | 111011101110000101… |
… | …011010101001000001 |
3 | 20010111220111122002021 |
4 | 323232011122221001 |
5 | 2022311212030033 |
6 | 45242542321441 |
7 | 4430023330423 |
oct | 735605325101 |
9 | 203456448067 |
10 | 64123939393 |
11 | 25216323838 |
12 | 10516b89281 |
13 | 607bc54907 |
14 | 316446a813 |
15 | 1a0480ab2d |
hex | eee15aa41 |
64123939393 has 2 divisors, whose sum is σ = 64123939394. Its totient is φ = 64123939392.
The previous prime is 64123939387. The next prime is 64123939403. The reversal of 64123939393 is 39393932146.
64123939393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61875567504 + 2248371889 = 248748^2 + 47417^2 .
It is a cyclic number.
It is not a de Polignac number, because 64123939393 - 29 = 64123938881 is a prime.
It is a super-2 number, since 2×641239393932 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 64123939393.
It is not a weakly prime, because it can be changed into another prime (64123939343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32061969696 + 32061969697.
It is an arithmetic number, because the mean of its divisors is an integer number (32061969697).
Almost surely, 264123939393 is an apocalyptic number.
It is an amenable number.
64123939393 is a deficient number, since it is larger than the sum of its proper divisors (1).
64123939393 is an equidigital number, since it uses as much as digits as its factorization.
64123939393 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2834352, while the sum is 52.
The spelling of 64123939393 in words is "sixty-four billion, one hundred twenty-three million, nine hundred thirty-nine thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •