Base | Representation |
---|---|
bin | 101100101111110100011… |
… | …1100100000000000000001 |
3 | 210202221020111222220210201 |
4 | 1121133220330200000001 |
5 | 1301230203112440101 |
6 | 21025135100125201 |
7 | 1203215614441531 |
oct | 131375074400001 |
9 | 23687214886721 |
10 | 6150006374401 |
11 | 1a612262a47aa |
12 | 833ab4836801 |
13 | 357c35031796 |
14 | 17393a35d4c1 |
15 | a9e983c5e01 |
hex | 597e8f20001 |
6150006374401 has 4 divisors (see below), whose sum is σ = 6150013878100. Its totient is φ = 6149998870704.
The previous prime is 6150006374333. The next prime is 6150006374453. The reversal of 6150006374401 is 1044736000516.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5939553894400 + 210452480001 = 2437120^2 + 458751^2 .
It is a cyclic number.
It is not a de Polignac number, because 6150006374401 - 211 = 6150006372353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6150006374471) 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, 2347146 + ... + 4220083.
It is an arithmetic number, because the mean of its divisors is an integer number (1537503469525).
Almost surely, 26150006374401 is an apocalyptic number.
It is an amenable number.
6150006374401 is a deficient number, since it is larger than the sum of its proper divisors (7503699).
6150006374401 is an equidigital number, since it uses as much as digits as its factorization.
6150006374401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7503698.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 6150006374401 in words is "six trillion, one hundred fifty billion, six million, three hundred seventy-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •