Base | Representation |
---|---|
bin | 10000110111001… |
… | …00100100101111 |
3 | 100212011011122101 |
4 | 20123210210233 |
5 | 242202223143 |
6 | 22011355531 |
7 | 3335160220 |
oct | 1033444457 |
9 | 325134571 |
10 | 141445423 |
11 | 7292a049 |
12 | 3b452ba7 |
13 | 233c5222 |
14 | 14add247 |
15 | c63eb4d |
hex | 86e492f |
141445423 has 16 divisors (see below), whose sum is σ = 178606080. Its totient is φ = 109143936.
The previous prime is 141445417. The next prime is 141445429. The reversal of 141445423 is 324544141.
141445423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (141445417) and next prime (141445429).
It is a cyclic number.
It is not a de Polignac number, because 141445423 - 25 = 141445391 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141445391 and 141445400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141445429) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23103 + ... + 28576.
It is an arithmetic number, because the mean of its divisors is an integer number (11162880).
Almost surely, 2141445423 is an apocalyptic number.
141445423 is a deficient number, since it is larger than the sum of its proper divisors (37160657).
141445423 is a wasteful number, since it uses less digits than its factorization.
141445423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51726.
The product of its digits is 7680, while the sum is 28.
The square root of 141445423 is about 11893.0829897046. The cubic root of 141445423 is about 521.0302835196.
Adding to 141445423 its reverse (324544141), we get a palindrome (465989564).
The spelling of 141445423 in words is "one hundred forty-one million, four hundred forty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •