Base | Representation |
---|---|
bin | 110000111110000000… |
… | …1110000100000010110 |
3 | 101001102210012002002222 |
4 | 1201330001300200112 |
5 | 3210331433110320 |
6 | 120150532502342 |
7 | 10411651453061 |
oct | 1417401604026 |
9 | 331383162088 |
10 | 105160050710 |
11 | 4066411a620 |
12 | 18469a7a9b2 |
13 | 9bbb878ba0 |
14 | 51384a58d8 |
15 | 2b07258825 |
hex | 187c070816 |
105160050710 has 64 divisors (see below), whose sum is σ = 222777112320. Its totient is φ = 35235511680.
The previous prime is 105160050703. The next prime is 105160050713. The reversal of 105160050710 is 17050061501.
It is a super-2 number, since 2×1051600507102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
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 105160050710.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105160050713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 739781 + ... + 870399.
It is an arithmetic number, because the mean of its divisors is an integer number (3480892380).
Almost surely, 2105160050710 is an apocalyptic number.
105160050710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105160050710 is an abundant number, since it is smaller than the sum of its proper divisors (117617061610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105160050710 is a wasteful number, since it uses less digits than its factorization.
105160050710 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131213.
The product of its (nonzero) digits is 1050, while the sum is 26.
The spelling of 105160050710 in words is "one hundred five billion, one hundred sixty million, fifty thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •