Base | Representation |
---|---|
bin | 1010010101000011110000… |
… | …0000010001010110101101 |
3 | 1111012201010220102010011101 |
4 | 2211100330000101112231 |
5 | 2442032412430002134 |
6 | 40053142110123101 |
7 | 2251336401133663 |
oct | 245207400212655 |
9 | 44181126363141 |
10 | 11356900234669 |
11 | 3689486121740 |
12 | 1335062ab0491 |
13 | 644c49737872 |
14 | 2b39695d4c33 |
15 | 14a6443bbe14 |
hex | a543c0115ad |
11356900234669 has 8 divisors (see below), whose sum is σ = 12442518870912. Its totient is φ = 10280143791840.
The previous prime is 11356900234661. The next prime is 11356900234699. The reversal of 11356900234669 is 96643200965311.
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 11356900234669 - 23 = 11356900234661 is a prime.
It is a super-3 number, since 3×113569002346693 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11356900234661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2215545669 + ... + 2215550794.
It is an arithmetic number, because the mean of its divisors is an integer number (1555314858864).
Almost surely, 211356900234669 is an apocalyptic number.
It is an amenable number.
11356900234669 is a deficient number, since it is larger than the sum of its proper divisors (1085618636243).
11356900234669 is a wasteful number, since it uses less digits than its factorization.
11356900234669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4431096707.
The product of its (nonzero) digits is 6298560, while the sum is 55.
The spelling of 11356900234669 in words is "eleven trillion, three hundred fifty-six billion, nine hundred million, two hundred thirty-four thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •