Base | Representation |
---|---|
bin | 110000011101011111110011… |
… | …000100011000001010011010 |
3 | 1000221122100010221222000120021 |
4 | 300131133303010120022122 |
5 | 210413433333433443232 |
6 | 2033144020412421054 |
7 | 62615240243515156 |
oct | 6035376304301232 |
9 | 1027570127860507 |
10 | 213133240140442 |
11 | 61a02332761696 |
12 | 1baa2796a7778a |
13 | 91c04bc1a308b |
14 | 3a8b9bd58c066 |
15 | 1999140c66397 |
hex | c1d7f311829a |
213133240140442 has 64 divisors (see below), whose sum is σ = 352243707678720. Its totient is φ = 96280313875200.
The previous prime is 213133240140419. The next prime is 213133240140449. The reversal of 213133240140442 is 244041042331312.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 213133240140398 and 213133240140407.
It is not an unprimeable number, because it can be changed into a prime (213133240140449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 322625113 + ... + 323285059.
It is an arithmetic number, because the mean of its divisors is an integer number (5503807932480).
Almost surely, 2213133240140442 is an apocalyptic number.
213133240140442 is a deficient number, since it is larger than the sum of its proper divisors (139110467538278).
213133240140442 is a wasteful number, since it uses less digits than its factorization.
213133240140442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662467.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 213133240140442 its reverse (244041042331312), we get a palindrome (457174282471754).
The spelling of 213133240140442 in words is "two hundred thirteen trillion, one hundred thirty-three billion, two hundred forty million, one hundred forty thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •