Base | Representation |
---|---|
bin | 1001100010001101010011… |
… | …0001001100100111011101 |
3 | 1101010012012111101100100110 |
4 | 2120203110301030213131 |
5 | 2333224234201300030 |
6 | 34143542404120233 |
7 | 2131251460425120 |
oct | 230432461144735 |
9 | 41105174340313 |
10 | 10483289868765 |
11 | 3381a359175aa |
12 | 1213894696079 |
13 | 5b075437447c |
14 | 283572d6a3b7 |
15 | 132a63a5b1b0 |
hex | 988d4c4c9dd |
10483289868765 has 32 divisors (see below), whose sum is σ = 19253891266560. Its totient is φ = 4771249349184.
The previous prime is 10483289868761. The next prime is 10483289868833. The reversal of 10483289868765 is 56786898238401.
It is not a de Polignac number, because 10483289868765 - 22 = 10483289868761 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10483289868761) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 219889945 + ... + 219937614.
It is an arithmetic number, because the mean of its divisors is an integer number (601684102080).
It is a 1-persistent number, because it is pandigital, but 2⋅10483289868765 = 20966579737530 is not.
Almost surely, 210483289868765 is an apocalyptic number.
10483289868765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10483289868765 is a deficient number, since it is larger than the sum of its proper divisors (8770601397795).
10483289868765 is a wasteful number, since it uses less digits than its factorization.
10483289868765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439827801.
The product of its (nonzero) digits is 1114767360, while the sum is 75.
The spelling of 10483289868765 in words is "ten trillion, four hundred eighty-three billion, two hundred eighty-nine million, eight hundred sixty-eight thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •