Base | Representation |
---|---|
bin | 1000001111000111101… |
… | …1110001000101000101 |
3 | 111112020020022121111001 |
4 | 2003301323301011011 |
5 | 4304241432230203 |
6 | 145000411413301 |
7 | 13136310363214 |
oct | 2036173610505 |
9 | 445206277431 |
10 | 141497930053 |
11 | 55010990167 |
12 | 2350b454231 |
13 | 1046000b03c |
14 | 6bc455307b |
15 | 3a324ac91d |
hex | 20f1ef1145 |
141497930053 has 4 divisors (see below), whose sum is σ = 141501139488. Its totient is φ = 141494720620.
The previous prime is 141497930047. The next prime is 141497930071. The reversal of 141497930053 is 350039794141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141497930053 - 29 = 141497929541 is a prime.
It is a super-4 number, since 4×1414979300534 (a number of 46 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141497929985 and 141497930012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141497930083) 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, 1537651 + ... + 1627072.
It is an arithmetic number, because the mean of its divisors is an integer number (35375284872).
Almost surely, 2141497930053 is an apocalyptic number.
It is an amenable number.
141497930053 is a deficient number, since it is larger than the sum of its proper divisors (3209435).
141497930053 is an equidigital number, since it uses as much as digits as its factorization.
141497930053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3209434.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 141497930053 in words is "one hundred forty-one billion, four hundred ninety-seven million, nine hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •