Base | Representation |
---|---|
bin | 1001001100011100111100… |
… | …0011011110101101001001 |
3 | 1022210110110122201102002011 |
4 | 2103013033003132231021 |
5 | 2311113310122442101 |
6 | 33300131012335521 |
7 | 2062250423554564 |
oct | 223071703365511 |
9 | 38713418642064 |
10 | 10109531843401 |
11 | 3248479197151 |
12 | 11733659145a1 |
13 | 58442b66c393 |
14 | 26d4380894db |
15 | 127e8adb2751 |
hex | 931cf0deb49 |
10109531843401 has 9 divisors (see below), whose sum is σ = 10350244778349. Its totient is φ = 9874292910636.
The previous prime is 10109531843371. The next prime is 10109531843407. The reversal of 10109531843401 is 10434813590101.
The square root of 10109531843401 is 3179549.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 10109531843401 - 233 = 10100941908809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10109531843407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 136683636 + ... + 136757578.
Almost surely, 210109531843401 is an apocalyptic number.
10109531843401 is the 3179549-th square number.
10109531843401 is the 1589775-th centered octagonal number.
It is an amenable number.
10109531843401 is a deficient number, since it is larger than the sum of its proper divisors (240712934948).
10109531843401 is an frugal number, since it uses more digits than its factorization.
10109531843401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147972 (or 73986 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 40.
The spelling of 10109531843401 in words is "ten trillion, one hundred nine billion, five hundred thirty-one million, eight hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •