Base | Representation |
---|---|
bin | 1010001000011110101111… |
… | …0110110001001000110100 |
3 | 1110110001101000020122010020 |
4 | 2202013223312301020310 |
5 | 2430012333120420312 |
6 | 35410003254325140 |
7 | 2226616405511304 |
oct | 242075366611064 |
9 | 43401330218106 |
10 | 11140807201332 |
11 | 3605876252396 |
12 | 12bb1b59597b0 |
13 | 62a75c2ba973 |
14 | 2a730a085604 |
15 | 144be81c678c |
hex | a21ebdb1234 |
11140807201332 has 12 divisors (see below), whose sum is σ = 25995216803136. Its totient is φ = 3713602400440.
The previous prime is 11140807201297. The next prime is 11140807201373. The reversal of 11140807201332 is 23310270804111.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 11140807201293 and 11140807201302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 464200300044 + ... + 464200300067.
It is an arithmetic number, because the mean of its divisors is an integer number (2166268066928).
Almost surely, 211140807201332 is an apocalyptic number.
11140807201332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11140807201332 is an abundant number, since it is smaller than the sum of its proper divisors (14854409601804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140807201332 is a wasteful number, since it uses less digits than its factorization.
11140807201332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928400600118 (or 928400600116 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 33.
The spelling of 11140807201332 in words is "eleven trillion, one hundred forty billion, eight hundred seven million, two hundred one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •