Base | Representation |
---|---|
bin | 1011101001100110001… |
… | …0000010011010000111 |
3 | 201010121101212112100201 |
4 | 2322121202002122013 |
5 | 11234343422114143 |
6 | 231540043351331 |
7 | 20313522520150 |
oct | 2723142023207 |
9 | 633541775321 |
10 | 200144332423 |
11 | 779762922a2 |
12 | 32957b22547 |
13 | 15b481b5489 |
14 | 9989332927 |
15 | 5315e8464d |
hex | 2e99882687 |
200144332423 has 8 divisors (see below), whose sum is σ = 229018428800. Its totient is φ = 171340748280.
The previous prime is 200144332411. The next prime is 200144332429. The reversal of 200144332423 is 324233441002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200144332423 - 217 = 200144201351 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200144332391 and 200144332400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200144332429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17621973 + ... + 17633326.
It is an arithmetic number, because the mean of its divisors is an integer number (28627303600).
Almost surely, 2200144332423 is an apocalyptic number.
200144332423 is a deficient number, since it is larger than the sum of its proper divisors (28874096377).
200144332423 is an equidigital number, since it uses as much as digits as its factorization.
200144332423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35256117.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 200144332423 its reverse (324233441002), we get a palindrome (524377773425).
The spelling of 200144332423 in words is "two hundred billion, one hundred forty-four million, three hundred thirty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •