Base | Representation |
---|---|
bin | 111001101101001000… |
… | …0111111000100100111 |
3 | 102211212021011112012102 |
4 | 1303122100333010213 |
5 | 4012242232020043 |
6 | 132532320242315 |
7 | 11644606602614 |
oct | 1633220770447 |
9 | 384767145172 |
10 | 123920970023 |
11 | 4861117aa14 |
12 | 20024a7039b |
13 | b8bb628086 |
14 | 5dd7da750b |
15 | 33543196b8 |
hex | 1cda43f127 |
123920970023 has 4 divisors (see below), whose sum is σ = 130443126360. Its totient is φ = 117398813688.
The previous prime is 123920969987. The next prime is 123920970037. The reversal of 123920970023 is 320079029321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320079029321 = 151 ⋅2119728671.
It is a cyclic number.
It is not a de Polignac number, because 123920970023 - 210 = 123920968999 is a prime.
It is a super-2 number, since 2×1239209700232 (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 (123920970053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3261078140 + ... + 3261078177.
It is an arithmetic number, because the mean of its divisors is an integer number (32610781590).
Almost surely, 2123920970023 is an apocalyptic number.
123920970023 is a deficient number, since it is larger than the sum of its proper divisors (6522156337).
123920970023 is an equidigital number, since it uses as much as digits as its factorization.
123920970023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6522156336.
The product of its (nonzero) digits is 40824, while the sum is 38.
Adding to 123920970023 its reverse (320079029321), we get a palindrome (443999999344).
The spelling of 123920970023 in words is "one hundred twenty-three billion, nine hundred twenty million, nine hundred seventy thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •