Base | Representation |
---|---|
bin | 10011000000000000… |
… | …11010010101100001 |
3 | 222022220022222022111 |
4 | 21200000122111201 |
5 | 131342331431301 |
6 | 4404111235321 |
7 | 510532065352 |
oct | 114000322541 |
9 | 28286288274 |
10 | 10200655201 |
11 | 4365005260 |
12 | 1b88218b41 |
13 | c67443a69 |
14 | 6caa75d29 |
15 | 3ea7e6551 |
hex | 26001a561 |
10200655201 has 4 divisors (see below), whose sum is σ = 11127987504. Its totient is φ = 9273322900.
The previous prime is 10200655193. The next prime is 10200655211. The reversal of 10200655201 is 10255600201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10200655201 - 23 = 10200655193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200655211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 463666135 + ... + 463666156.
It is an arithmetic number, because the mean of its divisors is an integer number (2781996876).
Almost surely, 210200655201 is an apocalyptic number.
10200655201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10200655201 is a deficient number, since it is larger than the sum of its proper divisors (927332303).
10200655201 is an equidigital number, since it uses as much as digits as its factorization.
10200655201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927332302.
The product of its (nonzero) digits is 600, while the sum is 22.
Multiplying 10200655201 by its sum of digits (22), we get a palindrome (224414414422).
The spelling of 10200655201 in words is "ten billion, two hundred million, six hundred fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •