Base | Representation |
---|---|
bin | 1001110001001010110100… |
… | …0111110010110001000111 |
3 | 1102000202122120002010220222 |
4 | 2130102231013302301013 |
5 | 2401432140110210234 |
6 | 34502011450414555 |
7 | 2155651131665363 |
oct | 234225507626107 |
9 | 42022576063828 |
10 | 10740322741319 |
11 | 3470a44208016 |
12 | 125566843145b |
13 | 5cba674a88c2 |
14 | 291b978142a3 |
15 | 1395a8ed442e |
hex | 9c4ad1f2c47 |
10740322741319 has 2 divisors, whose sum is σ = 10740322741320. Its totient is φ = 10740322741318.
The previous prime is 10740322741283. The next prime is 10740322741361. The reversal of 10740322741319 is 91314722304701.
10740322741319 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 is a cyclic number.
It is not a de Polignac number, because 10740322741319 - 232 = 10736027774023 is a prime.
It is a super-2 number, since 2×107403227413192 (a number of 27 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 10740322741319.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10740322701319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5370161370659 + 5370161370660.
It is an arithmetic number, because the mean of its divisors is an integer number (5370161370660).
Almost surely, 210740322741319 is an apocalyptic number.
10740322741319 is a deficient number, since it is larger than the sum of its proper divisors (1).
10740322741319 is an equidigital number, since it uses as much as digits as its factorization.
10740322741319 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 254016, while the sum is 44.
The spelling of 10740322741319 in words is "ten trillion, seven hundred forty billion, three hundred twenty-two million, seven hundred forty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •