Base | Representation |
---|---|
bin | 111001011100001000… |
… | …1101100101000110001 |
3 | 102210101112011101202012 |
4 | 1302320101230220301 |
5 | 4010110241400223 |
6 | 132355550132305 |
7 | 11624513626235 |
oct | 1627021545061 |
9 | 383345141665 |
10 | 123350731313 |
11 | 483492aa157 |
12 | 1baa5ab1095 |
13 | b82a44c914 |
14 | 5d8236a5c5 |
15 | 331e229c78 |
hex | 1cb846ca31 |
123350731313 has 8 divisors (see below), whose sum is σ = 126689352768. Its totient is φ = 120012363504.
The previous prime is 123350731303. The next prime is 123350731331. The reversal of 123350731313 is 313137053321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123350731313 - 210 = 123350730289 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123350731313.
It is not an unprimeable number, because it can be changed into a prime (123350731303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1332470 + ... + 1422032.
It is an arithmetic number, because the mean of its divisors is an integer number (15836169096).
Almost surely, 2123350731313 is an apocalyptic number.
It is an amenable number.
123350731313 is a deficient number, since it is larger than the sum of its proper divisors (3338621455).
123350731313 is an equidigital number, since it uses as much as digits as its factorization.
123350731313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126823.
The product of its (nonzero) digits is 17010, while the sum is 32.
Adding to 123350731313 its reverse (313137053321), we get a palindrome (436487784634).
The spelling of 123350731313 in words is "one hundred twenty-three billion, three hundred fifty million, seven hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •