Base | Representation |
---|---|
bin | 110001000010111001… |
… | …1101100001111100101 |
3 | 101001212012221102222121 |
4 | 1202011303230033211 |
5 | 3211200434313042 |
6 | 120215113425541 |
7 | 10416013244065 |
oct | 1420563541745 |
9 | 331765842877 |
10 | 105324135397 |
11 | 407388018a8 |
12 | 184b4a0b2b1 |
13 | 9c16869910 |
14 | 51521b93a5 |
15 | 2b1686b367 |
hex | 1885cec3e5 |
105324135397 has 8 divisors (see below), whose sum is σ = 115839311616. Its totient is φ = 95153719152.
The previous prime is 105324135349. The next prime is 105324135419. The reversal of 105324135397 is 793531423501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105324135397 - 227 = 105189917669 is a prime.
It is a super-2 number, since 2×1053241353972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105324139397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86189353 + ... + 86190574.
It is an arithmetic number, because the mean of its divisors is an integer number (14479913952).
Almost surely, 2105324135397 is an apocalyptic number.
It is an amenable number.
105324135397 is a deficient number, since it is larger than the sum of its proper divisors (10515176219).
105324135397 is a wasteful number, since it uses less digits than its factorization.
105324135397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172379987.
The product of its (nonzero) digits is 340200, while the sum is 43.
Adding to 105324135397 its reverse (793531423501), we get a palindrome (898855558898).
The spelling of 105324135397 in words is "one hundred five billion, three hundred twenty-four million, one hundred thirty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •