Base | Representation |
---|---|
bin | 10110111110100111100000… |
… | …011100011011001000000110 |
3 | 111020211020122201101121221222 |
4 | 112332213200130123020012 |
5 | 101221231441032230420 |
6 | 554534202503440342 |
7 | 30200230163346560 |
oct | 2676474034331006 |
9 | 436736581347858 |
10 | 101060051055110 |
11 | 2a223366210634 |
12 | b4021467560b2 |
13 | 4450bca606394 |
14 | 1ad54927dc330 |
15 | ba3c0cec1225 |
hex | 5be9e071b206 |
101060051055110 has 32 divisors (see below), whose sum is σ = 208209478093632. Its totient is φ = 34596741041280.
The previous prime is 101060051055101. The next prime is 101060051055121. The reversal of 101060051055110 is 11550150060101.
It is a super-2 number, since 2×1010600510551102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101060051055110.
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, 1092022577 + ... + 1092115116.
It is an arithmetic number, because the mean of its divisors is an integer number (6506546190426).
Almost surely, 2101060051055110 is an apocalyptic number.
101060051055110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101060051055110 is an abundant number, since it is smaller than the sum of its proper divisors (107149427038522).
101060051055110 is a wasteful number, since it uses less digits than its factorization.
101060051055110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184138368.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 101060051055110 in words is "one hundred one trillion, sixty billion, fifty-one million, fifty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •