Base | Representation |
---|---|
bin | 11101101010011101100101… |
… | …00010100001110100000111 |
3 | 22112221222202002222201012112 |
4 | 32311032302202201310013 |
5 | 32022214344403021244 |
6 | 350422315255011235 |
7 | 16511521441113005 |
oct | 1665166242416407 |
9 | 275858662881175 |
10 | 65230663720199 |
11 | 1986a19512368a |
12 | 7396181369b1b |
13 | 2a522c09a2953 |
14 | 121727681ba75 |
15 | 781bec77a39e |
hex | 3b53b28a1d07 |
65230663720199 has 32 divisors (see below), whose sum is σ = 67955315472000. Its totient is φ = 62539108853760.
The previous prime is 65230663720193. The next prime is 65230663720207. The reversal of 65230663720199 is 99102736603256.
65230663720199 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 65230663720199 - 212 = 65230663716103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65230663720193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6325085867 + ... + 6325096179.
It is an arithmetic number, because the mean of its divisors is an integer number (2123603608500).
Almost surely, 265230663720199 is an apocalyptic number.
65230663720199 is a deficient number, since it is larger than the sum of its proper divisors (2724651751801).
65230663720199 is a wasteful number, since it uses less digits than its factorization.
65230663720199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12635.
The product of its (nonzero) digits is 22044960, while the sum is 59.
The spelling of 65230663720199 in words is "sixty-five trillion, two hundred thirty billion, six hundred sixty-three million, seven hundred twenty thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •