Base | Representation |
---|---|
bin | 100010000011001011011… |
… | …1000100100010001010101 |
3 | 121120101020212201222022101 |
4 | 1010012112320210101111 |
5 | 1103133112200440443 |
6 | 13541503044402101 |
7 | 662046405305422 |
oct | 104062670442125 |
9 | 17511225658271 |
10 | 4679750796373 |
11 | 1544742361934 |
12 | 636b730a6331 |
13 | 27c3b6066983 |
14 | 12270320cd49 |
15 | 81ae74bd84d |
hex | 44196e24455 |
4679750796373 has 2 divisors, whose sum is σ = 4679750796374. Its totient is φ = 4679750796372.
The previous prime is 4679750796323. The next prime is 4679750796403. The reversal of 4679750796373 is 3736970579764.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4628104597809 + 51646198564 = 2151303^2 + 227258^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4679750796373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4679750796296 and 4679750796305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4679750796323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2339875398186 + 2339875398187.
It is an arithmetic number, because the mean of its divisors is an integer number (2339875398187).
Almost surely, 24679750796373 is an apocalyptic number.
It is an amenable number.
4679750796373 is a deficient number, since it is larger than the sum of its proper divisors (1).
4679750796373 is an equidigital number, since it uses as much as digits as its factorization.
4679750796373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260236880, while the sum is 73.
The spelling of 4679750796373 in words is "four trillion, six hundred seventy-nine billion, seven hundred fifty million, seven hundred ninety-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •