Base | Representation |
---|---|
bin | 1001110010110000101000… |
… | …10101010010100110000110 |
3 | 2211020202101120201120200122 |
4 | 10321120110111102212012 |
5 | 10310313302112211104 |
6 | 113445103350341542 |
7 | 4351605662322656 |
oct | 471302425224606 |
9 | 84222346646618 |
10 | 21535307147654 |
11 | 6953088507aa3 |
12 | 24b982a95a8b2 |
13 | c02a03452291 |
14 | 546458b08366 |
15 | 2752b1c326be |
hex | 139614552986 |
21535307147654 has 8 divisors (see below), whose sum is σ = 32303698346568. Its totient is φ = 10767407698800.
The previous prime is 21535307147623. The next prime is 21535307147659. The reversal of 21535307147654 is 45674170353512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×215353071476542 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21535307147596 and 21535307147605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21535307147659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 122828012 + ... + 123003215.
It is an arithmetic number, because the mean of its divisors is an integer number (4037962293321).
Almost surely, 221535307147654 is an apocalyptic number.
21535307147654 is a deficient number, since it is larger than the sum of its proper divisors (10768391198914).
21535307147654 is a wasteful number, since it uses less digits than its factorization.
21535307147654 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245875030.
The product of its (nonzero) digits is 10584000, while the sum is 53.
The spelling of 21535307147654 in words is "twenty-one trillion, five hundred thirty-five billion, three hundred seven million, one hundred forty-seven thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •