Base | Representation |
---|---|
bin | 11101101010011101100101… |
… | …00010100001110100001000 |
3 | 22112221222202002222201012120 |
4 | 32311032302202201310020 |
5 | 32022214344403021300 |
6 | 350422315255011240 |
7 | 16511521441113006 |
oct | 1665166242416410 |
9 | 275858662881176 |
10 | 65230663720200 |
11 | 1986a195123690 |
12 | 7396181369b20 |
13 | 2a522c09a2954 |
14 | 121727681ba76 |
15 | 781bec77a3a0 |
hex | 3b53b28a1d08 |
65230663720200 has 96 divisors (see below), whose sum is σ = 220598244603360. Its totient is φ = 15813494233600.
The previous prime is 65230663720193. The next prime is 65230663720207. The reversal of 65230663720200 is 202736603256.
It is an interprime number because it is at equal distance from previous prime (65230663720193) and next prime (65230663720207).
It is not an unprimeable number, because it can be changed into a prime (65230663720207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4941710349 + ... + 4941723548.
It is an arithmetic number, because the mean of its divisors is an integer number (2297898381285).
Almost surely, 265230663720200 is an apocalyptic number.
65230663720200 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
65230663720200 is an abundant number, since it is smaller than the sum of its proper divisors (155367580883160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65230663720200 is a wasteful number, since it uses less digits than its factorization.
65230663720200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9883433927 (or 9883433918 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 42.
The spelling of 65230663720200 in words is "sixty-five trillion, two hundred thirty billion, six hundred sixty-three million, seven hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •