Base | Representation |
---|---|
bin | 111001010111101101… |
… | …1001101011111010111 |
3 | 102210000011201202120010 |
4 | 1302233123031133113 |
5 | 4004304232331411 |
6 | 132333123211303 |
7 | 11621031451413 |
oct | 1625733153727 |
9 | 383004652503 |
10 | 123202230231 |
11 | 482824a1093 |
12 | 1ba64216b33 |
13 | b805757062 |
14 | 5d6a751d43 |
15 | 33111947a6 |
hex | 1caf6cd7d7 |
123202230231 has 8 divisors (see below), whose sum is σ = 164292711280. Its totient is φ = 82123284672.
The previous prime is 123202230223. The next prime is 123202230251. The reversal of 123202230231 is 132032202321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123202230231 - 23 = 123202230223 is a prime.
It is a super-2 number, since 2×1232022302312 (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 = 123202230198 and 123202230207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123202230251) 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, 2858920 + ... + 2901693.
It is an arithmetic number, because the mean of its divisors is an integer number (20536588910).
Almost surely, 2123202230231 is an apocalyptic number.
123202230231 is a deficient number, since it is larger than the sum of its proper divisors (41090481049).
123202230231 is an equidigital number, since it uses as much as digits as its factorization.
123202230231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5767745.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 123202230231 its reverse (132032202321), we get a palindrome (255234432552).
The spelling of 123202230231 in words is "one hundred twenty-three billion, two hundred two million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •