Base | Representation |
---|---|
bin | 110000000010011000111… |
… | …001001001001100111111 |
3 | 102200120201100001002121022 |
4 | 300002120321021030333 |
5 | 413041123100000223 |
6 | 11004300541254355 |
7 | 460332223012625 |
oct | 60023071111477 |
9 | 12616640032538 |
10 | 3301100000063 |
11 | 1062a96988338 |
12 | 4539378643bb |
13 | 1ac3a550c508 |
14 | b5aba177515 |
15 | 5ad08788ac8 |
hex | 30098e4933f |
3301100000063 has 2 divisors, whose sum is σ = 3301100000064. Its totient is φ = 3301100000062.
The previous prime is 3301099999999. The next prime is 3301100000153. The reversal of 3301100000063 is 3600000011033.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3301100000063 - 26 = 3301099999999 is a prime.
It is a super-2 number, since 2×33011000000632 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3301099999987 and 3301100000050.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3301100200063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650550000031 + 1650550000032.
It is an arithmetic number, because the mean of its divisors is an integer number (1650550000032).
Almost surely, 23301100000063 is an apocalyptic number.
3301100000063 is a deficient number, since it is larger than the sum of its proper divisors (1).
3301100000063 is an equidigital number, since it uses as much as digits as its factorization.
3301100000063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 3301100000063 its reverse (3600000011033), we get a palindrome (6901100011096).
The spelling of 3301100000063 in words is "three trillion, three hundred one billion, one hundred million, sixty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •