Base | Representation |
---|---|
bin | 101101110001110001001001… |
… | …101011000110101000011111 |
3 | 222101212011101211002011101002 |
4 | 231301301021223012220133 |
5 | 202342111141442102143 |
6 | 1552110411144340515 |
7 | 60256523460110336 |
oct | 5561611153065037 |
9 | 871764354064332 |
10 | 201332123003423 |
11 | 59172523799455 |
12 | 1a6b762077473b |
13 | 88456cb531749 |
14 | 37a0753570d1d |
15 | 184219d19b5b8 |
hex | b71c49ac6a1f |
201332123003423 has 4 divisors (see below), whose sum is σ = 201604561600920. Its totient is φ = 201059684405928.
The previous prime is 201332123003399. The next prime is 201332123003449. The reversal of 201332123003423 is 324300321233102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201332123003423 - 230 = 201331049261599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201332123003483) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136219297640 + ... + 136219299117.
It is an arithmetic number, because the mean of its divisors is an integer number (50401140400230).
Almost surely, 2201332123003423 is an apocalyptic number.
201332123003423 is a deficient number, since it is larger than the sum of its proper divisors (272438597497).
201332123003423 is an equidigital number, since it uses as much as digits as its factorization.
201332123003423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272438597496.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 201332123003423 its reverse (324300321233102), we get a palindrome (525632444236525).
The spelling of 201332123003423 in words is "two hundred one trillion, three hundred thirty-two billion, one hundred twenty-three million, three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •