Base | Representation |
---|---|
bin | 111001011011001101… |
… | …0100101011111100111 |
3 | 102210022100102000221011 |
4 | 1302312122211133213 |
5 | 4010024243210134 |
6 | 132352513003051 |
7 | 11623654341100 |
oct | 1626632453747 |
9 | 383270360834 |
10 | 123319506919 |
11 | 48332712874 |
12 | 1ba97553487 |
13 | b823b3954b |
14 | 5d7c15d3a7 |
15 | 331b60d264 |
hex | 1cb66a57e7 |
123319506919 has 12 divisors (see below), whose sum is σ = 143459058744. Its totient is φ = 105698194224.
The previous prime is 123319506913. The next prime is 123319506971. The reversal of 123319506919 is 919605913321.
It is a happy number.
It is not a de Polignac number, because 123319506919 - 225 = 123285952487 is a prime.
It is a super-2 number, since 2×1233195069192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123319506913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2170437 + ... + 2226529.
It is an arithmetic number, because the mean of its divisors is an integer number (11954921562).
Almost surely, 2123319506919 is an apocalyptic number.
123319506919 is a deficient number, since it is larger than the sum of its proper divisors (20139551825).
123319506919 is an equidigital number, since it uses as much as digits as its factorization.
123319506919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100974 (or 100967 counting only the distinct ones).
The product of its (nonzero) digits is 393660, while the sum is 49.
The spelling of 123319506919 in words is "one hundred twenty-three billion, three hundred nineteen million, five hundred six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •