Base | Representation |
---|---|
bin | 1001110010100111011010… |
… | …00111011100101010000110 |
3 | 2211020021121101221210212101 |
4 | 10321103231013130222012 |
5 | 10310223131141141014 |
6 | 113442524100342314 |
7 | 4351342151313235 |
oct | 471235507345206 |
9 | 84207541853771 |
10 | 21530354240134 |
11 | 6950a767452a3 |
12 | 24b88880a499a |
13 | c023c42a157c |
14 | 546108dc4b1c |
15 | 2750c1ece474 |
hex | 1394ed1dca86 |
21530354240134 has 8 divisors (see below), whose sum is σ = 32295764287800. Its totient is φ = 10765099477536.
The previous prime is 21530354240117. The next prime is 21530354240173. The reversal of 21530354240134 is 43104245303512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×215303542401342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21530354240093 and 21530354240102.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 38474019 + ... + 39029614.
It is an arithmetic number, because the mean of its divisors is an integer number (4036970535975).
Almost surely, 221530354240134 is an apocalyptic number.
21530354240134 is a deficient number, since it is larger than the sum of its proper divisors (10765410047666).
21530354240134 is a wasteful number, since it uses less digits than its factorization.
21530354240134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77642534.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 21530354240134 its reverse (43104245303512), we get a palindrome (64634599543646).
The spelling of 21530354240134 in words is "twenty-one trillion, five hundred thirty billion, three hundred fifty-four million, two hundred forty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •