Base | Representation |
---|---|
bin | 10000111010100… |
… | …11100011101011 |
3 | 100220000021012222 |
4 | 20131103203223 |
5 | 242311300021 |
6 | 22025224255 |
7 | 3342062441 |
oct | 1035234353 |
9 | 326007188 |
10 | 141900011 |
11 | 7310a640 |
12 | 3b63208b |
13 | 23524106 |
14 | 14bbab91 |
15 | c6ce6ab |
hex | 87538eb |
141900011 has 4 divisors (see below), whose sum is σ = 154800024. Its totient is φ = 129000000.
The previous prime is 141900007. The next prime is 141900047. The reversal of 141900011 is 110009141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110009141 = 11 ⋅10000831.
It is a cyclic number.
It is not a de Polignac number, because 141900011 - 22 = 141900007 is a prime.
It is a super-2 number, since 2×1419000112 = 40271226243600242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141902011) 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, 6449990 + ... + 6450011.
It is an arithmetic number, because the mean of its divisors is an integer number (38700006).
Almost surely, 2141900011 is an apocalyptic number.
141900011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141900011 is a deficient number, since it is larger than the sum of its proper divisors (12900013).
141900011 is a wasteful number, since it uses less digits than its factorization.
141900011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12900012.
The product of its (nonzero) digits is 36, while the sum is 17.
The square root of 141900011 is about 11912.1791037576. The cubic root of 141900011 is about 521.5878621289.
Adding to 141900011 its reverse (110009141), we get a palindrome (251909152).
The spelling of 141900011 in words is "one hundred forty-one million, nine hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •