Base | Representation |
---|---|
bin | 10000110110011… |
… | …10010111101001 |
3 | 100211222112212212 |
4 | 20123032113221 |
5 | 242141320343 |
6 | 22005414505 |
7 | 3334331111 |
oct | 1033162751 |
9 | 324875785 |
10 | 141354473 |
11 | 72877787 |
12 | 3b40a435 |
13 | 23392a00 |
14 | 14ab8041 |
15 | c622c18 |
hex | 86ce5e9 |
141354473 has 12 divisors (see below), whose sum is σ = 162071388. Its totient is φ = 122803200.
The previous prime is 141354461. The next prime is 141354487. The reversal of 141354473 is 374453141.
It can be written as a sum of positive squares in 6 ways, for example, as 33028009 + 108326464 = 5747^2 + 10408^2 .
It is not a de Polignac number, because 141354473 - 28 = 141354217 is a prime.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (141354403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21728 + ... + 27473.
It is an arithmetic number, because the mean of its divisors is an integer number (13505949).
Almost surely, 2141354473 is an apocalyptic number.
141354473 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
141354473 is a deficient number, since it is larger than the sum of its proper divisors (20716915).
141354473 is a wasteful number, since it uses less digits than its factorization.
141354473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49244 (or 49231 counting only the distinct ones).
The product of its digits is 20160, while the sum is 32.
The square root of 141354473 is about 11889.2587237388. The cubic root of 141354473 is about 520.9185846897.
The spelling of 141354473 in words is "one hundred forty-one million, three hundred fifty-four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •