Base | Representation |
---|---|
bin | 1001010111101110110010… |
… | …1101110111111001000101 |
3 | 1100110222121220101021222000 |
4 | 2111323230231313321011 |
5 | 2322302131033233242 |
6 | 33525134433255513 |
7 | 2112250311456051 |
oct | 225735455677105 |
9 | 40428556337860 |
10 | 10303303024197 |
11 | 3312673a50287 |
12 | 11a4a23404599 |
13 | 59979c387b01 |
14 | 27897abd6c61 |
15 | 12d02c5a0a4c |
hex | 95eecb77e45 |
10303303024197 has 8 divisors (see below), whose sum is σ = 15264152628480. Its totient is φ = 6868868682780.
The previous prime is 10303303024121. The next prime is 10303303024219. The reversal of 10303303024197 is 79142030330301.
It is a happy number.
10303303024197 is a `hidden beast` number, since 1 + 0 + 3 + 0 + 330 + 302 + 4 + 19 + 7 = 666.
It is a de Polignac number, because none of the positive numbers 2k-10303303024197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303303024097) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190801907829 + ... + 190801907882.
It is an arithmetic number, because the mean of its divisors is an integer number (1908019078560).
Almost surely, 210303303024197 is an apocalyptic number.
It is an amenable number.
10303303024197 is a deficient number, since it is larger than the sum of its proper divisors (4960849604283).
10303303024197 is an equidigital number, since it uses as much as digits as its factorization.
10303303024197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381603815720 (or 381603815714 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 36.
Adding to 10303303024197 its reverse (79142030330301), we get a palindrome (89445333354498).
The spelling of 10303303024197 in words is "ten trillion, three hundred three billion, three hundred three million, twenty-four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •