Base | Representation |
---|---|
bin | 1010000000101010001110… |
… | …1111011110110010111110 |
3 | 1102222012120122202121001121 |
4 | 2200022203233132302332 |
5 | 2420312204024023340 |
6 | 35224143405101154 |
7 | 2214122113543522 |
oct | 240124357366276 |
9 | 42865518677047 |
10 | 11006453345470 |
11 | 35638a0a80980 |
12 | 129915ab577ba |
13 | 61ab9a3bb47b |
14 | 2a0a02673d82 |
15 | 141482ee194a |
hex | a02a3bdecbe |
11006453345470 has 32 divisors (see below), whose sum is σ = 22115292312960. Its totient is φ = 3909268839840.
The previous prime is 11006453345431. The next prime is 11006453345471. The reversal of 11006453345470 is 7454335460011.
It is a happy number.
It is a super-2 number, since 2×110064533454702 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11006453345471) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1163468140 + ... + 1163477599.
It is an arithmetic number, because the mean of its divisors is an integer number (691102884780).
Almost surely, 211006453345470 is an apocalyptic number.
11006453345470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11006453345470 is an abundant number, since it is smaller than the sum of its proper divisors (11108838967490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11006453345470 is a wasteful number, since it uses less digits than its factorization.
11006453345470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2326945800.
The product of its (nonzero) digits is 604800, while the sum is 43.
The spelling of 11006453345470 in words is "eleven trillion, six billion, four hundred fifty-three million, three hundred forty-five thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •