Base | Representation |
---|---|
bin | 1011101101011110… |
… | …0000000100010111 |
3 | 22010002001100101222 |
4 | 2323113200010113 |
5 | 22414214000210 |
6 | 1235532040555 |
7 | 140620211123 |
oct | 27327400427 |
9 | 8102040358 |
10 | 3143500055 |
11 | 1373473133 |
12 | 73890315b |
13 | 3b1348a07 |
14 | 21b6bc583 |
15 | 135e8c655 |
hex | bb5e0117 |
3143500055 has 4 divisors (see below), whose sum is σ = 3772200072. Its totient is φ = 2514800040.
The previous prime is 3143500033. The next prime is 3143500097. The reversal of 3143500055 is 5500053413.
3143500055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3143500055 - 26 = 3143499991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3143499997 and 3143500033.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314350001 + ... + 314350010.
It is an arithmetic number, because the mean of its divisors is an integer number (943050018).
Almost surely, 23143500055 is an apocalyptic number.
3143500055 is a deficient number, since it is larger than the sum of its proper divisors (628700017).
3143500055 is an equidigital number, since it uses as much as digits as its factorization.
3143500055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 628700016.
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 3143500055 is about 56066.9247863658. The cubic root of 3143500055 is about 1464.8882340079. Note that the first 3 decimals are identical.
Adding to 3143500055 its reverse (5500053413), we get a palindrome (8643553468).
The spelling of 3143500055 in words is "three billion, one hundred forty-three million, five hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •