Base | Representation |
---|---|
bin | 10100000000101011… |
… | …01110110111000001 |
3 | 1000201201001210112121 |
4 | 22000111232313001 |
5 | 134000214141301 |
6 | 4534010124241 |
7 | 530136654400 |
oct | 120025566701 |
9 | 30651053477 |
10 | 10743115201 |
11 | 4613232505 |
12 | 20b9a20681 |
13 | 1022944300 |
14 | 73cb21637 |
15 | 42d24a3a1 |
hex | 28056edc1 |
10743115201 has 81 divisors (see below), whose sum is σ = 14592958569. Its totient is φ = 7880640768.
The previous prime is 10743115189. The next prime is 10743115219. The reversal of 10743115201 is 10251134701.
The square root of 10743115201 is 103649.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 97002801 + 10646112400 = 9849^2 + 103180^2 .
It is not a de Polignac number, because 10743115201 - 215 = 10743082433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10743115291) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 160344970 + ... + 160345036.
Almost surely, 210743115201 is an apocalyptic number.
10743115201 is the 103649-th square number.
10743115201 is the 51825-th centered octagonal number.
It is an amenable number.
10743115201 is a deficient number, since it is larger than the sum of its proper divisors (3849843368).
10743115201 is an equidigital number, since it uses as much as digits as its factorization.
10743115201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208 (or 104 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 25.
Multiplying 10743115201 by its sum of digits (25), we get a square (268577880025 = 5182452).
Adding to 10743115201 its reverse (10251134701), we get a palindrome (20994249902).
The spelling of 10743115201 in words is "ten billion, seven hundred forty-three million, one hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •