Base | Representation |
---|---|
bin | 1001011011110101001100… |
… | …0011100000001111001001 |
3 | 1100201201102201221022201001 |
4 | 2112331103003200033021 |
5 | 2324430404244302431 |
6 | 34021344034255001 |
7 | 2120322635260102 |
oct | 226752303401711 |
9 | 40651381838631 |
10 | 10373739447241 |
11 | 333a529525455 |
12 | 11b6600427461 |
13 | 5a3316057441 |
14 | 27c13d7753a9 |
15 | 12eca116be61 |
hex | 96f530e03c9 |
10373739447241 has 9 divisors (see below), whose sum is σ = 10620741454509. Its totient is φ = 10132354417836.
The previous prime is 10373739447163. The next prime is 10373739447271. The reversal of 10373739447241 is 14274493737301.
The square root of 10373739447241 is 3220829.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 10373739447241 - 235 = 10339379708873 is a prime.
It is a super-2 number, since 2×103737394472412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10373739447271) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 138458196 + ... + 138533098.
Almost surely, 210373739447241 is an apocalyptic number.
10373739447241 is the 3220829-th square number.
10373739447241 is the 1610415-th centered octagonal number.
It is an amenable number.
10373739447241 is a deficient number, since it is larger than the sum of its proper divisors (247002007268).
10373739447241 is an frugal number, since it uses more digits than its factorization.
10373739447241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149892 (or 74946 counting only the distinct ones).
The product of its (nonzero) digits is 10668672, while the sum is 55.
The spelling of 10373739447241 in words is "ten trillion, three hundred seventy-three billion, seven hundred thirty-nine million, four hundred forty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •