Base | Representation |
---|---|
bin | 100100111000010010000… |
… | …010100011010001111001 |
3 | 22222021120001100010112112 |
4 | 210320102002203101321 |
5 | 313010303320111241 |
6 | 5220131235222105 |
7 | 351046100103524 |
oct | 44702202432171 |
9 | 8867501303475 |
10 | 2534333363321 |
11 | 897894128311 |
12 | 34b207147935 |
13 | 154ca9778536 |
14 | 8a93b84bbbb |
15 | 45dccdae1eb |
hex | 24e120a3479 |
2534333363321 has 8 divisors (see below), whose sum is σ = 2540405400960. Its totient is φ = 2528263905552.
The previous prime is 2534333363293. The next prime is 2534333363333. The reversal of 2534333363321 is 1233633334352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2534333363321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2534333363381) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1329311 + ... + 2614523.
It is an arithmetic number, because the mean of its divisors is an integer number (317550675120).
Almost surely, 22534333363321 is an apocalyptic number.
It is an amenable number.
2534333363321 is a deficient number, since it is larger than the sum of its proper divisors (6072037639).
2534333363321 is a wasteful number, since it uses less digits than its factorization.
2534333363321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289935.
The product of its digits is 1049760, while the sum is 41.
Adding to 2534333363321 its reverse (1233633334352), we get a palindrome (3767966697673).
The spelling of 2534333363321 in words is "two trillion, five hundred thirty-four billion, three hundred thirty-three million, three hundred sixty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •