Base | Representation |
---|---|
bin | 1001110010100111100011… |
… | …10000101001101100100111 |
3 | 2211020021210211120001112111 |
4 | 10321103301300221230213 |
5 | 10310223311112302221 |
6 | 113442535522301451 |
7 | 4351344115453510 |
oct | 471236160515447 |
9 | 84207724501474 |
10 | 21530432150311 |
11 | 6951006719377 |
12 | 24b88aa1b7887 |
13 | c0240747c676 |
14 | 5461154a5a07 |
15 | 2750c8c6dbe1 |
hex | 1394f1c29b27 |
21530432150311 has 8 divisors (see below), whose sum is σ = 25206359590944. Its totient is φ = 18004542564480.
The previous prime is 21530432150287. The next prime is 21530432150327. The reversal of 21530432150311 is 11305123403512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21530432150311 - 221 = 21530430053159 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21530435150311) 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 7 ways as a sum of consecutive naturals, for example, 37509463390 + ... + 37509463963.
It is an arithmetic number, because the mean of its divisors is an integer number (3150794948868).
Almost surely, 221530432150311 is an apocalyptic number.
21530432150311 is a deficient number, since it is larger than the sum of its proper divisors (3675927440633).
21530432150311 is an equidigital number, since it uses as much as digits as its factorization.
21530432150311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75018927401.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 21530432150311 its reverse (11305123403512), we get a palindrome (32835555553823).
The spelling of 21530432150311 in words is "twenty-one trillion, five hundred thirty billion, four hundred thirty-two million, one hundred fifty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •