Base | Representation |
---|---|
bin | 11101111110001001100… |
… | …00001001100101001101 |
3 | 10122110002101212210022122 |
4 | 32333010300021211031 |
5 | 113333011310441422 |
6 | 2105025512022325 |
7 | 134254233523316 |
oct | 16770460114515 |
9 | 3573071783278 |
10 | 1029798140237 |
11 | 36780a226779 |
12 | 1476b93919a5 |
13 | 761568a4c99 |
14 | 37bb1b4760d |
15 | 1bbc27b9d42 |
hex | efc4c0994d |
1029798140237 has 4 divisors (see below), whose sum is σ = 1053746934240. Its totient is φ = 1005849346236.
The previous prime is 1029798140207. The next prime is 1029798140303. The reversal of 1029798140237 is 7320418979201.
1029798140237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1029798140237 - 224 = 1029781363021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1029798140207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11974396937 + ... + 11974397022.
It is an arithmetic number, because the mean of its divisors is an integer number (263436733560).
Almost surely, 21029798140237 is an apocalyptic number.
It is an amenable number.
1029798140237 is a deficient number, since it is larger than the sum of its proper divisors (23948794003).
1029798140237 is an equidigital number, since it uses as much as digits as its factorization.
1029798140237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23948794002.
The product of its (nonzero) digits is 1524096, while the sum is 53.
The spelling of 1029798140237 in words is "one trillion, twenty-nine billion, seven hundred ninety-eight million, one hundred forty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •