Base | Representation |
---|---|
bin | 10000110101011… |
… | …11110010101111 |
3 | 100211202012002021 |
4 | 20122233302233 |
5 | 242123313411 |
6 | 22003011011 |
7 | 3333300013 |
oct | 1032576257 |
9 | 324665067 |
10 | 141229231 |
11 | 727a1680 |
12 | 3b369a67 |
13 | 2334a9c0 |
14 | 14a84543 |
15 | c5eaa71 |
hex | 86afcaf |
141229231 has 32 divisors (see below), whose sum is σ = 171263232. Its totient is φ = 114773760.
The previous prime is 141229189. The next prime is 141229237. The reversal of 141229231 is 132922141.
It is a cyclic number.
It is not a de Polignac number, because 141229231 - 29 = 141228719 is a prime.
It is a super-2 number, since 2×1412292312 = 39891391377702722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141229196 and 141229205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141229237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 866356 + ... + 866518.
It is an arithmetic number, because the mean of its divisors is an integer number (5351976).
Almost surely, 2141229231 is an apocalyptic number.
141229231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141229231 is a deficient number, since it is larger than the sum of its proper divisors (30034001).
141229231 is a wasteful number, since it uses less digits than its factorization.
141229231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343.
The product of its digits is 864, while the sum is 25.
The square root of 141229231 is about 11883.9905334866. The cubic root of 141229231 is about 520.7646922291.
The spelling of 141229231 in words is "one hundred forty-one million, two hundred twenty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •