Base | Representation |
---|---|
bin | 111001010101100011… |
… | …1110000110100110111 |
3 | 102202211010212021011111 |
4 | 1302223013300310313 |
5 | 4004132241220343 |
6 | 132322023415451 |
7 | 11616163633354 |
oct | 1625307606467 |
9 | 382733767144 |
10 | 123130023223 |
11 | 48245762979 |
12 | 1ba43bb4587 |
13 | b7c37c4b0c |
14 | 5d60d1762b |
15 | 3309b7ec9d |
hex | 1cab1f0d37 |
123130023223 has 8 divisors (see below), whose sum is σ = 128530074240. Its totient is φ = 117819229440.
The previous prime is 123130023221. The next prime is 123130023227. The reversal of 123130023223 is 322320031321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123130023223 - 21 = 123130023221 is a prime.
It is a super-2 number, since 2×1231300232232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123130023194 and 123130023203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123130023221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22311490 + ... + 22317007.
It is an arithmetic number, because the mean of its divisors is an integer number (16066259280).
Almost surely, 2123130023223 is an apocalyptic number.
123130023223 is a deficient number, since it is larger than the sum of its proper divisors (5400051017).
123130023223 is an equidigital number, since it uses as much as digits as its factorization.
123130023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44628617.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 123130023223 its reverse (322320031321), we get a palindrome (445450054544).
The spelling of 123130023223 in words is "one hundred twenty-three billion, one hundred thirty million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •