Base | Representation |
---|---|
bin | 1011011100100010… |
… | …10100001001100001 |
3 | 120212020220100022211 |
4 | 11232101110021201 |
5 | 100041110000113 |
6 | 2453432402121 |
7 | 305164431664 |
oct | 55621241141 |
9 | 16766810284 |
10 | 6145000033 |
11 | 2673768527 |
12 | 1235b46341 |
13 | 76c136bc3 |
14 | 4241956db |
15 | 25e72ab3d |
hex | 16e454261 |
6145000033 has 2 divisors, whose sum is σ = 6145000034. Its totient is φ = 6145000032.
The previous prime is 6145000027. The next prime is 6145000061. The reversal of 6145000033 is 3300005416.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6144678544 + 321489 = 78388^2 + 567^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6145000033 is a prime.
It is a super-2 number, since 2×61450000332 = 75522050811140002178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6144999968 and 6145000013.
It is not a weakly prime, because it can be changed into another prime (6145000093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3072500016 + 3072500017.
It is an arithmetic number, because the mean of its divisors is an integer number (3072500017).
Almost surely, 26145000033 is an apocalyptic number.
It is an amenable number.
6145000033 is a deficient number, since it is larger than the sum of its proper divisors (1).
6145000033 is an equidigital number, since it uses as much as digits as its factorization.
6145000033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 6145000033 is about 78390.0505995499. The cubic root of 6145000033 is about 1831.6421535293.
Adding to 6145000033 its reverse (3300005416), we get a palindrome (9445005449).
The spelling of 6145000033 in words is "six billion, one hundred forty-five million, thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •