Base | Representation |
---|---|
bin | 111001010001110001… |
… | …1111110001011011101 |
3 | 102202111022012222201021 |
4 | 1302203203332023131 |
5 | 4003402304401341 |
6 | 132301253244141 |
7 | 11613063644116 |
oct | 1624343761335 |
9 | 382438188637 |
10 | 123003200221 |
11 | 48190110980 |
12 | 1ba09633651 |
13 | b7a344c415 |
14 | 5d4c14320d |
15 | 32ed97c9d1 |
hex | 1ca38fe2dd |
123003200221 has 8 divisors (see below), whose sum is σ = 140019453504. Its totient is φ = 106959304320.
The previous prime is 123003200207. The next prime is 123003200251. The reversal of 123003200221 is 122002300321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123003200221 - 25 = 123003200189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123003200195 and 123003200204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123003200251) 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, 243089076 + ... + 243089581.
It is an arithmetic number, because the mean of its divisors is an integer number (17502431688).
Almost surely, 2123003200221 is an apocalyptic number.
123003200221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
123003200221 is a deficient number, since it is larger than the sum of its proper divisors (17016253283).
123003200221 is a wasteful number, since it uses less digits than its factorization.
123003200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486178691.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 123003200221 its reverse (122002300321), we get a palindrome (245005500542).
The spelling of 123003200221 in words is "one hundred twenty-three billion, three million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •