Base | Representation |
---|---|
bin | 111001011000100100… |
… | …1011011011001010111 |
3 | 102210002012002200000211 |
4 | 1302301021123121113 |
5 | 4004334131414111 |
6 | 132340034350251 |
7 | 11621532156112 |
oct | 1626111333127 |
9 | 383065080024 |
10 | 123231123031 |
11 | 48297835735 |
12 | 1ba71a2b387 |
13 | b80b7320a3 |
14 | 5d70513579 |
15 | 33139a0521 |
hex | 1cb125b657 |
123231123031 has 4 divisors (see below), whose sum is σ = 125070393592. Its totient is φ = 121391852472.
The previous prime is 123231123017. The next prime is 123231123061. The reversal of 123231123031 is 130321132321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123231123031 - 223 = 123222734423 is a prime.
It is a super-2 number, since 2×1232311230312 (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 = 123231122993 and 123231123011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123231123061) 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, 919635180 + ... + 919635313.
It is an arithmetic number, because the mean of its divisors is an integer number (31267598398).
Almost surely, 2123231123031 is an apocalyptic number.
123231123031 is a deficient number, since it is larger than the sum of its proper divisors (1839270561).
123231123031 is an equidigital number, since it uses as much as digits as its factorization.
123231123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1839270560.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 123231123031 its reverse (130321132321), we get a palindrome (253552255352).
The spelling of 123231123031 in words is "one hundred twenty-three billion, two hundred thirty-one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •