Base | Representation |
---|---|
bin | 111001011011111101… |
… | …0111011000010110101 |
3 | 102210101002221002000222 |
4 | 1302313322323002311 |
5 | 4010102224323023 |
6 | 132355214144125 |
7 | 11624412112145 |
oct | 1626772730265 |
9 | 383332832028 |
10 | 123344761013 |
11 | 483459a1621 |
12 | 1baa3ab2045 |
13 | b82913c2b6 |
14 | 5d81654925 |
15 | 331d94acc8 |
hex | 1cb7ebb0b5 |
123344761013 has 4 divisors (see below), whose sum is σ = 129836590560. Its totient is φ = 116852931468.
The previous prime is 123344761003. The next prime is 123344761027. The reversal of 123344761013 is 310167443321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310167443321 = 2063 ⋅150347767.
It is a cyclic number.
It is not a de Polignac number, because 123344761013 - 222 = 123340566709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123344761003) 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 3 ways as a sum of consecutive naturals, for example, 3245914745 + ... + 3245914782.
It is an arithmetic number, because the mean of its divisors is an integer number (32459147640).
Almost surely, 2123344761013 is an apocalyptic number.
It is an amenable number.
123344761013 is a deficient number, since it is larger than the sum of its proper divisors (6491829547).
123344761013 is an equidigital number, since it uses as much as digits as its factorization.
123344761013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6491829546.
The product of its (nonzero) digits is 36288, while the sum is 35.
The spelling of 123344761013 in words is "one hundred twenty-three billion, three hundred forty-four million, seven hundred sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •