Base | Representation |
---|---|
bin | 1001100111110111… |
… | …10001001100110011 |
3 | 111100001020212200201 |
4 | 10303323301030303 |
5 | 41040031221311 |
6 | 2212351100031 |
7 | 242011412242 |
oct | 46373611463 |
9 | 14301225621 |
10 | 5166273331 |
11 | 221125468a |
12 | 1002211617 |
13 | 64443788b |
14 | 3701c4959 |
15 | 20384c9c1 |
hex | 133ef1333 |
5166273331 has 8 divisors (see below), whose sum is σ = 5268441024. Its totient is φ = 5065056360.
The previous prime is 5166273257. The next prime is 5166273383. The reversal of 5166273331 is 1333726615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5166273331 - 227 = 5032055603 is a prime.
It is a super-2 number, since 2×51662733312 = 53380760261203671122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5166273391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 226701 + ... + 248446.
It is an arithmetic number, because the mean of its divisors is an integer number (658555128).
Almost surely, 25166273331 is an apocalyptic number.
5166273331 is a deficient number, since it is larger than the sum of its proper divisors (102167693).
5166273331 is a wasteful number, since it uses less digits than its factorization.
5166273331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475361.
The product of its digits is 68040, while the sum is 37.
The square root of 5166273331 is about 71876.7927150342. The cubic root of 5166273331 is about 1728.7245246850.
Adding to 5166273331 its reverse (1333726615), we get a palindrome (6499999946).
The spelling of 5166273331 in words is "five billion, one hundred sixty-six million, two hundred seventy-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •