Base | Representation |
---|---|
bin | 1011011101001010… |
… | …10000000111101011 |
3 | 120212121201212120101 |
4 | 11232211100013223 |
5 | 100043424221121 |
6 | 2454140410231 |
7 | 305260030150 |
oct | 55645200753 |
9 | 16777655511 |
10 | 6150226411 |
11 | 267670814a |
12 | 1237846977 |
13 | 770246a34 |
14 | 424b56227 |
15 | 25ee0e491 |
hex | 16e9501eb |
6150226411 has 4 divisors (see below), whose sum is σ = 7028830192. Its totient is φ = 5271622632.
The previous prime is 6150226409. The next prime is 6150226429. The reversal of 6150226411 is 1146220516.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6150226411 - 21 = 6150226409 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6150226411.
It is not an unprimeable number, because it can be changed into a prime (6150226471) 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 3 ways as a sum of consecutive naturals, for example, 439301880 + ... + 439301893.
It is an arithmetic number, because the mean of its divisors is an integer number (1757207548).
Almost surely, 26150226411 is an apocalyptic number.
6150226411 is a deficient number, since it is larger than the sum of its proper divisors (878603781).
6150226411 is an equidigital number, since it uses as much as digits as its factorization.
6150226411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878603780.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 6150226411 is about 78423.3792373167. The cubic root of 6150226411 is about 1832.1612824446.
Adding to 6150226411 its reverse (1146220516), we get a palindrome (7296446927).
The spelling of 6150226411 in words is "six billion, one hundred fifty million, two hundred twenty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •