Base | Representation |
---|---|
bin | 1001010001111101110110… |
… | …0000100100010011110001 |
3 | 1100010111222200021210020102 |
4 | 2110133131200210103301 |
5 | 2314141312442130230 |
6 | 33411435103322145 |
7 | 2102143110505541 |
oct | 224373540442361 |
9 | 40114880253212 |
10 | 10204263630065 |
11 | 328467088162a |
12 | 11897a32b0355 |
13 | 5903478a170b |
14 | 273c6358b321 |
15 | 12a682865045 |
hex | 947dd8244f1 |
10204263630065 has 4 divisors (see below), whose sum is σ = 12245116356084. Its totient is φ = 8163410904048.
The previous prime is 10204263630031. The next prime is 10204263630083. The reversal of 10204263630065 is 56003636240201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2108440490209 + 8095823139856 = 1452047^2 + 2845316^2 .
It is a cyclic number.
It is not a de Polignac number, because 10204263630065 - 28 = 10204263629809 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1020426363002 + ... + 1020426363011.
It is an arithmetic number, because the mean of its divisors is an integer number (3061279089021).
Almost surely, 210204263630065 is an apocalyptic number.
It is an amenable number.
10204263630065 is a deficient number, since it is larger than the sum of its proper divisors (2040852726019).
10204263630065 is an equidigital number, since it uses as much as digits as its factorization.
10204263630065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2040852726018.
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 10204263630065 its reverse (56003636240201), we get a palindrome (66207899870266).
The spelling of 10204263630065 in words is "ten trillion, two hundred four billion, two hundred sixty-three million, six hundred thirty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •