Base | Representation |
---|---|
bin | 110000111111101000… |
… | …0100001100001010111 |
3 | 101001120120011211212111 |
4 | 1201333100201201113 |
5 | 3210434322100033 |
6 | 120200150331451 |
7 | 10413210252466 |
oct | 1417720414127 |
9 | 331516154774 |
10 | 105214253143 |
11 | 4069178071a |
12 | 18484059b87 |
13 | 9bc9b7602c |
14 | 51417749dd |
15 | 2b0bdb37cd |
hex | 187f421857 |
105214253143 has 4 divisors (see below), whose sum is σ = 105239195560. Its totient is φ = 105189310728.
The previous prime is 105214253101. The next prime is 105214253153. The reversal of 105214253143 is 341352412501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341352412501 = 2287 ⋅149257723.
It is a cyclic number.
It is not a de Polignac number, because 105214253143 - 29 = 105214252631 is a prime.
It is a super-2 number, since 2×1052142531432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105214253153) 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, 12464880 + ... + 12473317.
It is an arithmetic number, because the mean of its divisors is an integer number (26309798890).
Almost surely, 2105214253143 is an apocalyptic number.
105214253143 is a deficient number, since it is larger than the sum of its proper divisors (24942417).
105214253143 is an equidigital number, since it uses as much as digits as its factorization.
105214253143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24942416.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 105214253143 its reverse (341352412501), we get a palindrome (446566665644).
The spelling of 105214253143 in words is "one hundred five billion, two hundred fourteen million, two hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •