Base | Representation |
---|---|
bin | 100000100100010001100011… |
… | …100100111101011010100100 |
3 | 200210010200021200201200122100 |
4 | 200210101203210331122210 |
5 | 122233141012421121012 |
6 | 1224343021445132100 |
7 | 42112020604314156 |
oct | 4044214344753244 |
9 | 623120250650570 |
10 | 143230240020132 |
11 | 417016705398a1 |
12 | 14092b916ba030 |
13 | 61bc7275818b5 |
14 | 275254854cad6 |
15 | 1185b31de08dc |
hex | 82446393d6a4 |
143230240020132 has 72 divisors (see below), whose sum is σ = 362369656419680. Its totient is φ = 47701829232000.
The previous prime is 143230240020067. The next prime is 143230240020169. The reversal of 143230240020132 is 231020042032341.
143230240020132 is a `hidden beast` number, since 1 + 4 + 3 + 23 + 0 + 2 + 400 + 201 + 32 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 143230240020096 and 143230240020105.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 285637632 + ... + 286138632.
Almost surely, 2143230240020132 is an apocalyptic number.
143230240020132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
143230240020132 is an abundant number, since it is smaller than the sum of its proper divisors (219139416399548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143230240020132 is a wasteful number, since it uses less digits than its factorization.
143230240020132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507913 (or 507908 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 143230240020132 its reverse (231020042032341), we get a palindrome (374250282052473).
The spelling of 143230240020132 in words is "one hundred forty-three trillion, two hundred thirty billion, two hundred forty million, twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •