Base | Representation |
---|---|
bin | 1101000111010001… |
… | …01010011111101011 |
3 | 200011122120222021022 |
4 | 12203220222133223 |
5 | 103404310011243 |
6 | 3122334203055 |
7 | 336315450551 |
oct | 64350523753 |
9 | 20148528238 |
10 | 7040313323 |
11 | 2a9308966a |
12 | 144595348b |
13 | 88277c294 |
14 | 4ab051bd1 |
15 | 2b312db68 |
hex | 1a3a2a7eb |
7040313323 has 2 divisors, whose sum is σ = 7040313324. Its totient is φ = 7040313322.
The previous prime is 7040313299. The next prime is 7040313349. The reversal of 7040313323 is 3233130407.
It is an a-pointer prime, because the next prime (7040313349) can be obtained adding 7040313323 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 7040313323 - 232 = 2745346027 is a prime.
It is a super-2 number, since 2×70403133232 = 99132023372022604658, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7040313292 and 7040313301.
It is not a weakly prime, because it can be changed into another prime (7040313223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3520156661 + 3520156662.
It is an arithmetic number, because the mean of its divisors is an integer number (3520156662).
Almost surely, 27040313323 is an apocalyptic number.
7040313323 is a deficient number, since it is larger than the sum of its proper divisors (1).
7040313323 is an equidigital number, since it uses as much as digits as its factorization.
7040313323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 26.
The square root of 7040313323 is about 83906.5749688307. The cubic root of 7040313323 is about 1916.5963753966.
The spelling of 7040313323 in words is "seven billion, forty million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •