Base | Representation |
---|---|
bin | 1011011011000101… |
… | …00101100001000001 |
3 | 120211101211222222202 |
4 | 11231202211201001 |
5 | 100024441003101 |
6 | 2452314042545 |
7 | 304655342531 |
oct | 55542454101 |
9 | 16741758882 |
10 | 6132750401 |
11 | 2667861168 |
12 | 1231a19455 |
13 | 7697383bb |
14 | 4226c74c1 |
15 | 25d60b36b |
hex | 16d8a5841 |
6132750401 has 4 divisors (see below), whose sum is σ = 6193470804. Its totient is φ = 6072030000.
The previous prime is 6132750331. The next prime is 6132750409. The reversal of 6132750401 is 1040572316.
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 3151699600 + 2981050801 = 56140^2 + 54599^2 .
It is a cyclic number.
It is not a de Polignac number, because 6132750401 - 222 = 6128556097 is a prime.
It is a super-2 number, since 2×61327504012 = 75221254961931321602, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6132750409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30360050 + ... + 30360251.
It is an arithmetic number, because the mean of its divisors is an integer number (1548367701).
Almost surely, 26132750401 is an apocalyptic number.
It is an amenable number.
6132750401 is a deficient number, since it is larger than the sum of its proper divisors (60720403).
6132750401 is a wasteful number, since it uses less digits than its factorization.
6132750401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60720402.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 6132750401 is about 78311.8790542022. The cubic root of 6132750401 is about 1830.4242599802.
The spelling of 6132750401 in words is "six billion, one hundred thirty-two million, seven hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •