Base | Representation |
---|---|
bin | 1001101101010000100011… |
… | …0110001101111111110101 |
3 | 1101210100020121222002022020 |
4 | 2123110020312031333311 |
5 | 2344332043343131042 |
6 | 34411101313423353 |
7 | 2151052261326342 |
oct | 233241066157765 |
9 | 41710217862266 |
10 | 10673142161397 |
11 | 34454aa557a91 |
12 | 124463986ab59 |
13 | 5c561c1ca971 |
14 | 28c8234397c9 |
15 | 1379761973ec |
hex | 9b508d8dff5 |
10673142161397 has 8 divisors (see below), whose sum is σ = 14263272745920. Its totient is φ = 7099219842240.
The previous prime is 10673142161333. The next prime is 10673142161477. The reversal of 10673142161397 is 79316124137601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10673142161397 - 26 = 10673142161333 is a prime.
It is a super-2 number, since 2×106731421613972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10673142161497) 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, 4052064804 + ... + 4052067437.
It is an arithmetic number, because the mean of its divisors is an integer number (1782909093240).
Almost surely, 210673142161397 is an apocalyptic number.
It is an amenable number.
10673142161397 is a deficient number, since it is larger than the sum of its proper divisors (3590130584523).
10673142161397 is an equidigital number, since it uses as much as digits as its factorization.
10673142161397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8104132683.
The product of its (nonzero) digits is 1143072, while the sum is 51.
Adding to 10673142161397 its reverse (79316124137601), we get a palindrome (89989266298998).
The spelling of 10673142161397 in words is "ten trillion, six hundred seventy-three billion, one hundred forty-two million, one hundred sixty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •