Base | Representation |
---|---|
bin | 110000111001110101… |
… | …1101101011100000011 |
3 | 101001002000202110200220 |
4 | 1201303223231130003 |
5 | 3210040113201001 |
6 | 120125012114123 |
7 | 10405331503161 |
oct | 1416353553403 |
9 | 331060673626 |
10 | 105020053251 |
11 | 405a209a443 |
12 | 1842b005943 |
13 | 9b9886ca59 |
14 | 5123a62231 |
15 | 2ae9d02c36 |
hex | 1873aed703 |
105020053251 has 4 divisors (see below), whose sum is σ = 140026737672. Its totient is φ = 70013368832.
The previous prime is 105020053241. The next prime is 105020053261. The reversal of 105020053251 is 152350020501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (105020053241) and next prime (105020053261).
It is a cyclic number.
It is not a de Polignac number, because 105020053251 - 211 = 105020051203 is a prime.
It is a super-2 number, since 2×1050200532512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105020053211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17503342206 + ... + 17503342211.
It is an arithmetic number, because the mean of its divisors is an integer number (35006684418).
Almost surely, 2105020053251 is an apocalyptic number.
105020053251 is a deficient number, since it is larger than the sum of its proper divisors (35006684421).
105020053251 is an equidigital number, since it uses as much as digits as its factorization.
105020053251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35006684420.
The product of its (nonzero) digits is 1500, while the sum is 24.
Adding to 105020053251 its reverse (152350020501), we get a palindrome (257370073752).
The spelling of 105020053251 in words is "one hundred five billion, twenty million, fifty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •