Base | Representation |
---|---|
bin | 1011101101001111011… |
… | …1110000011010100111 |
3 | 201020010121121022010112 |
4 | 2323103313300122213 |
5 | 11243400003320143 |
6 | 232221130043235 |
7 | 20350006115633 |
oct | 2732367603247 |
9 | 636117538115 |
10 | 201123104423 |
11 | 7832882717a |
12 | 32b8b87951b |
13 | 15c72bcc2c7 |
14 | 9a3d315dc3 |
15 | 5371d70e18 |
hex | 2ed3df06a7 |
201123104423 has 32 divisors (see below), whose sum is σ = 216890234880. Its totient is φ = 186010007040.
The previous prime is 201123104407. The next prime is 201123104437. The reversal of 201123104423 is 324401321102.
It is a cyclic number.
It is not a de Polignac number, because 201123104423 - 24 = 201123104407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201123104023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151561586 + ... + 151562912.
It is an arithmetic number, because the mean of its divisors is an integer number (6777819840).
Almost surely, 2201123104423 is an apocalyptic number.
201123104423 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
201123104423 is a deficient number, since it is larger than the sum of its proper divisors (15767130457).
201123104423 is a wasteful number, since it uses less digits than its factorization.
201123104423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 201123104423 its reverse (324401321102), we get a palindrome (525524425525).
The spelling of 201123104423 in words is "two hundred one billion, one hundred twenty-three million, one hundred four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •