Base | Representation |
---|---|
bin | 1001100101011110… |
… | …10010001000101111 |
3 | 111021122112020000110 |
4 | 10302233102020233 |
5 | 41014413120101 |
6 | 2210353231103 |
7 | 241346114016 |
oct | 46257221057 |
9 | 14248466013 |
10 | 5146223151 |
11 | 22009aa693 |
12 | bb7562493 |
13 | 640237674 |
14 | 36b685a7d |
15 | 201bdbcd6 |
hex | 132bd222f |
5146223151 has 8 divisors (see below), whose sum is σ = 6862002304. Its totient is φ = 3430629720.
The previous prime is 5146223083. The next prime is 5146223161. The reversal of 5146223151 is 1513226415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5146223151 - 27 = 5146223023 is a prime.
It is a super-2 number, since 2×51462231512 = 52967225439776737602, which 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 (5146223161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42636 + ... + 110046.
It is an arithmetic number, because the mean of its divisors is an integer number (857750288).
Almost surely, 25146223151 is an apocalyptic number.
5146223151 is a deficient number, since it is larger than the sum of its proper divisors (1715779153).
5146223151 is a wasteful number, since it uses less digits than its factorization.
5146223151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92861.
The product of its digits is 7200, while the sum is 30.
The square root of 5146223151 is about 71737.1810918160. The cubic root of 5146223151 is about 1726.4852461696.
Adding to 5146223151 its reverse (1513226415), we get a palindrome (6659449566).
The spelling of 5146223151 in words is "five billion, one hundred forty-six million, two hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •