Base | Representation |
---|---|
bin | 100101010111101000001010… |
… | …111001001010000100010111 |
3 | 210112220211200201221120201220 |
4 | 211113220022321022010113 |
5 | 133020213132213214333 |
6 | 1341313554052421423 |
7 | 46421665636116561 |
oct | 4527501271120427 |
9 | 715824621846656 |
10 | 164351401304343 |
11 | 48405046449960 |
12 | 1652449b917873 |
13 | 70923697a5836 |
14 | 2c8291648c331 |
15 | 14002553d28b3 |
hex | 957a0ae4a117 |
164351401304343 has 16 divisors (see below), whose sum is σ = 243567085297536. Its totient is φ = 97727534222240.
The previous prime is 164351401304341. The next prime is 164351401304351. The reversal of 164351401304343 is 343403104153461.
It is a cyclic number.
It is not a de Polignac number, because 164351401304343 - 21 = 164351401304341 is a prime.
It is a super-2 number, since 2×1643514013043432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 164351401304295 and 164351401304304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164351401304341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46984389705 + ... + 46984393202.
It is an arithmetic number, because the mean of its divisors is an integer number (15222942831096).
Almost surely, 2164351401304343 is an apocalyptic number.
164351401304343 is a deficient number, since it is larger than the sum of its proper divisors (79215683993193).
164351401304343 is a wasteful number, since it uses less digits than its factorization.
164351401304343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93968782974.
The product of its (nonzero) digits is 622080, while the sum is 42.
The spelling of 164351401304343 in words is "one hundred sixty-four trillion, three hundred fifty-one billion, four hundred one million, three hundred four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •