Base | Representation |
---|---|
bin | 11110110111010111000… |
… | …00011011000101011110 |
3 | 10202101100222111102021122 |
4 | 33123223200123011132 |
5 | 114333412323201001 |
6 | 2131105404130542 |
7 | 136422334421324 |
oct | 17335340330536 |
9 | 3671328442248 |
10 | 1060513100126 |
11 | 379840aa7747 |
12 | 15164b836a52 |
13 | 7901011676c |
14 | 39487101d14 |
15 | 1c8be06db1b |
hex | f6eb81b15e |
1060513100126 has 32 divisors (see below), whose sum is σ = 1681440076800. Its totient is φ = 500265923040.
The previous prime is 1060513100099. The next prime is 1060513100191. The reversal of 1060513100126 is 6210013150601.
It is a super-2 number, since 2×10605131001262 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1060513100095 and 1060513100104.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 31774235 + ... + 31807593.
It is an arithmetic number, because the mean of its divisors is an integer number (52545002400).
Almost surely, 21060513100126 is an apocalyptic number.
1060513100126 is a deficient number, since it is larger than the sum of its proper divisors (620926976674).
1060513100126 is a wasteful number, since it uses less digits than its factorization.
1060513100126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36824.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 1060513100126 its reverse (6210013150601), we get a palindrome (7270526250727).
The spelling of 1060513100126 in words is "one trillion, sixty billion, five hundred thirteen million, one hundred thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •