Base | Representation |
---|---|
bin | 1010000010000011111011… |
… | …1110001010101101110111 |
3 | 1110001111201202221101211110 |
4 | 2200200332332022231313 |
5 | 2421211012310002333 |
6 | 35243205013010103 |
7 | 2215633610150316 |
oct | 240407676125567 |
9 | 43044652841743 |
10 | 11030532500343 |
11 | 3573028038374 |
12 | 12a195b023933 |
13 | 620236c102c5 |
14 | 2a1c485d627d |
15 | 141de1e1b063 |
hex | a083ef8ab77 |
11030532500343 has 8 divisors (see below), whose sum is σ = 15214527586800. Its totient is φ = 7100112873728.
The previous prime is 11030532500329. The next prime is 11030532500453. The reversal of 11030532500343 is 34300523503011.
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 11030532500343 - 237 = 10893093546871 is a prime.
It is a super-2 number, since 2×110305325003432 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11030532500343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030532500543) 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, 63393864858 + ... + 63393865031.
It is an arithmetic number, because the mean of its divisors is an integer number (1901815948350).
Almost surely, 211030532500343 is an apocalyptic number.
11030532500343 is a deficient number, since it is larger than the sum of its proper divisors (4183995086457).
11030532500343 is a wasteful number, since it uses less digits than its factorization.
11030532500343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126787729921.
The product of its (nonzero) digits is 16200, while the sum is 30.
The spelling of 11030532500343 in words is "eleven trillion, thirty billion, five hundred thirty-two million, five hundred thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •