Base | Representation |
---|---|
bin | 100000001000100011010111… |
… | …101010100000010010100100 |
3 | 200112101120002201112000222101 |
4 | 200020203113222200102210 |
5 | 122010433023332320312 |
6 | 1220323524420541444 |
7 | 41524260515515402 |
oct | 4010432752402244 |
9 | 615346081460871 |
10 | 141325222151332 |
11 | 41037765621aaa |
12 | 13a25936b51884 |
13 | 60b1bb008302b |
14 | 26c826a52a472 |
15 | 11512d7866a57 |
hex | 8088d7aa04a4 |
141325222151332 has 12 divisors (see below), whose sum is σ = 247322495081200. Its totient is φ = 70661652128136.
The previous prime is 141325222151329. The next prime is 141325222151353. The reversal of 141325222151332 is 233151222523141.
It is a super-3 number, since 3×1413252221513323 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 141325222151291 and 141325222151300.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 239405238 + ... + 239994829.
Almost surely, 2141325222151332 is an apocalyptic number.
It is an amenable number.
141325222151332 is a deficient number, since it is larger than the sum of its proper divisors (105997272929868).
141325222151332 is a wasteful number, since it uses less digits than its factorization.
141325222151332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479473770 (or 479473768 counting only the distinct ones).
The product of its digits is 86400, while the sum is 37.
Adding to 141325222151332 its reverse (233151222523141), we get a palindrome (374476444674473).
The spelling of 141325222151332 in words is "one hundred forty-one trillion, three hundred twenty-five billion, two hundred twenty-two million, one hundred fifty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •