Base | Representation |
---|---|
bin | 1000001101010011011… |
… | …1000000010000001111 |
3 | 111110222020110102101010 |
4 | 2003110313000100033 |
5 | 4302242044022343 |
6 | 144440144420303 |
7 | 13121235301236 |
oct | 2032467002017 |
9 | 443866412333 |
10 | 141010142223 |
11 | 54890604a25 |
12 | 233b4017693 |
13 | 103b2c406a2 |
14 | 6b79859b1d |
15 | 3a04757d33 |
hex | 20d4dc040f |
141010142223 has 8 divisors (see below), whose sum is σ = 188134128000. Its totient is φ = 93946458968.
The previous prime is 141010142197. The next prime is 141010142237. The reversal of 141010142223 is 322241010141.
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 141010142223 - 29 = 141010141711 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141010142223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141010142123) 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, 15070173 + ... + 15079526.
It is an arithmetic number, because the mean of its divisors is an integer number (23516766000).
Almost surely, 2141010142223 is an apocalyptic number.
141010142223 is a deficient number, since it is larger than the sum of its proper divisors (47123985777).
141010142223 is a wasteful number, since it uses less digits than its factorization.
141010142223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30151261.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 141010142223 its reverse (322241010141), we get a palindrome (463251152364).
The spelling of 141010142223 in words is "one hundred forty-one billion, ten million, one hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •