Base | Representation |
---|---|
bin | 1011011101001010… |
… | …01010010000001101 |
3 | 120212121200122121101 |
4 | 11232211022100031 |
5 | 100043422434011 |
6 | 2454140103101 |
7 | 305256600121 |
oct | 55645122015 |
9 | 16777618541 |
10 | 6150202381 |
11 | 26766a1094 |
12 | 1237834a91 |
13 | 770238b0b |
14 | 424b4b581 |
15 | 25ee072c1 |
hex | 16e94a40d |
6150202381 has 2 divisors, whose sum is σ = 6150202382. Its totient is φ = 6150202380.
The previous prime is 6150202379. The next prime is 6150202433. The reversal of 6150202381 is 1832020516.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5053930281 + 1096272100 = 71091^2 + 33110^2 .
It is a cyclic number.
It is not a de Polignac number, because 6150202381 - 21 = 6150202379 is a prime.
It is a super-2 number, since 2×61502023812 = 75649978654516138322, which contains 22 as substring.
Together with 6150202379, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6150202301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3075101190 + 3075101191.
It is an arithmetic number, because the mean of its divisors is an integer number (3075101191).
Almost surely, 26150202381 is an apocalyptic number.
It is an amenable number.
6150202381 is a deficient number, since it is larger than the sum of its proper divisors (1).
6150202381 is an equidigital number, since it uses as much as digits as its factorization.
6150202381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 6150202381 is about 78423.2260303030. The cubic root of 6150202381 is about 1832.1588962510.
Adding to 6150202381 its reverse (1832020516), we get a palindrome (7982222897).
The spelling of 6150202381 in words is "six billion, one hundred fifty million, two hundred two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •