Base | Representation |
---|---|
bin | 10111000011111000000100… |
… | …100000011110111111001110 |
3 | 111022002210110001221102111200 |
4 | 113003320010200132333032 |
5 | 101243142043414232032 |
6 | 555412210244330330 |
7 | 30235312444241361 |
oct | 2703700440367716 |
9 | 438083401842450 |
10 | 101421433352142 |
11 | 2a352652092132 |
12 | b4601a09a39a6 |
13 | 4479000382bb7 |
14 | 1b08b75c180d8 |
15 | bad30e42c47c |
hex | 5c3e0481efce |
101421433352142 has 192 divisors, whose sum is σ = 226367773632000. Its totient is φ = 32807478021120.
The previous prime is 101421433352101. The next prime is 101421433352159. The reversal of 101421433352142 is 241253334124101.
101421433352142 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 2 + 1 + 433 + 3 + 5 + 214 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 101421433352097 and 101421433352106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 48318928609 + ... + 48318930707.
It is an arithmetic number, because the mean of its divisors is an integer number (1178998821000).
Almost surely, 2101421433352142 is an apocalyptic number.
101421433352142 is an abundant number, since it is smaller than the sum of its proper divisors (124946340279858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101421433352142 is a wasteful number, since it uses less digits than its factorization.
101421433352142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4103 (or 4100 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 101421433352142 its reverse (241253334124101), we get a palindrome (342674767476243).
The spelling of 101421433352142 in words is "one hundred one trillion, four hundred twenty-one billion, four hundred thirty-three million, three hundred fifty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •