Base | Representation |
---|---|
bin | 111001010111101011… |
… | …1110111000101011111 |
3 | 102210000010002010220012 |
4 | 1302233113313011133 |
5 | 4004304021231111 |
6 | 132333052313435 |
7 | 11621021133152 |
oct | 1625727670537 |
9 | 383003063805 |
10 | 123201352031 |
11 | 48281a512aa |
12 | 1ba63a7287b |
13 | b80550a404 |
14 | 5d6a5a3c99 |
15 | 331106e48b |
hex | 1caf5f715f |
123201352031 has 8 divisors (see below), whose sum is σ = 125297778960. Its totient is φ = 121105200832.
The previous prime is 123201352009. The next prime is 123201352133. The reversal of 123201352031 is 130253102321.
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 123201352031 - 218 = 123201089887 is a prime.
It is a super-2 number, since 2×1232013520312 (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 = 123201351988 and 123201352006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123201352231) 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, 962411 + ... + 1082883.
It is an arithmetic number, because the mean of its divisors is an integer number (15662222370).
Almost surely, 2123201352031 is an apocalyptic number.
123201352031 is a deficient number, since it is larger than the sum of its proper divisors (2096426929).
123201352031 is a wasteful number, since it uses less digits than its factorization.
123201352031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137865.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 123201352031 its reverse (130253102321), we get a palindrome (253454454352).
The spelling of 123201352031 in words is "one hundred twenty-three billion, two hundred one million, three hundred fifty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •