Base | Representation |
---|---|
bin | 111001010111101011… |
… | …0101000100001001101 |
3 | 102210000002110210110022 |
4 | 1302233112220201031 |
5 | 4004303430431341 |
6 | 132333041351525 |
7 | 11621015323013 |
oct | 1625726504115 |
9 | 383002423408 |
10 | 123201030221 |
11 | 48281851545 |
12 | 1ba639385a5 |
13 | b805426aa9 |
14 | 5d6a51c8b3 |
15 | 3311008e4b |
hex | 1caf5a884d |
123201030221 has 8 divisors (see below), whose sum is σ = 124598185920. Its totient is φ = 121807740672.
The previous prime is 123201030187. The next prime is 123201030263. The reversal of 123201030221 is 122030102321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123201030221 - 210 = 123201029197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123201030221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123201038221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 902420 + ... + 1029933.
It is an arithmetic number, because the mean of its divisors is an integer number (15574773240).
Almost surely, 2123201030221 is an apocalyptic number.
It is an amenable number.
123201030221 is a deficient number, since it is larger than the sum of its proper divisors (1397155699).
123201030221 is a wasteful number, since it uses less digits than its factorization.
123201030221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1933075.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 123201030221 its reverse (122030102321), we get a palindrome (245231132542).
The spelling of 123201030221 in words is "one hundred twenty-three billion, two hundred one million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •