Base | Representation |
---|---|
bin | 100000100010101110001101… |
… | …000001010010100001000100 |
3 | 200202202110221001120120121101 |
4 | 200202232031001102201010 |
5 | 122224414023122130202 |
6 | 1224222020054225444 |
7 | 42101223160600006 |
oct | 4042561501224104 |
9 | 622673831516541 |
10 | 143123561130052 |
11 | 416703a8041828 |
12 | 1407637b055284 |
13 | 61b26561486b9 |
14 | 274b30847c376 |
15 | 1182e8b66a887 |
hex | 822b8d052844 |
143123561130052 has 12 divisors (see below), whose sum is σ = 251966029775040. Its totient is φ = 71133266908616.
The previous prime is 143123561130031. The next prime is 143123561130073. The reversal of 143123561130052 is 250031165321341.
143123561130052 is digitally balanced in base 3, 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 (143123561130031) and next prime (143123561130073).
It is a junction number, because it is equal to n+sod(n) for n = 143123561129993 and 143123561130020.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107128413352 + ... + 107128414687.
It is an arithmetic number, because the mean of its divisors is an integer number (20997169147920).
Almost surely, 2143123561130052 is an apocalyptic number.
It is an amenable number.
143123561130052 is a deficient number, since it is larger than the sum of its proper divisors (108842468644988).
143123561130052 is a wasteful number, since it uses less digits than its factorization.
143123561130052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214256828210 (or 214256828208 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 143123561130052 in words is "one hundred forty-three trillion, one hundred twenty-three billion, five hundred sixty-one million, one hundred thirty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •