Base | Representation |
---|---|
bin | 10000000110000111000… |
… | …101001110101010010000 |
3 | 10220201222010021112200121 |
4 | 100012013011032222100 |
5 | 121110214124440000 |
6 | 2204042312400024 |
7 | 142624342304131 |
oct | 20060705165220 |
9 | 3821863245617 |
10 | 1106072890000 |
11 | 3970a0347151 |
12 | 15a4456a6014 |
13 | 803c0cb5100 |
14 | 3b769c4bc88 |
15 | 1db88bd5b1a |
hex | 1018714ea90 |
1106072890000 has 225 divisors, whose sum is σ = 2903340823383. Its totient is φ = 407891328000.
The previous prime is 1106072889997. The next prime is 1106072890031. The reversal of 1106072890000 is 982706011.
It is a happy number.
The square root of 1106072890000 is 1051700.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 22 ways, for example, as 1042334818704 + 63738071296 = 1020948^2 + 252464^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 1367209596 + ... + 1367210404.
Almost surely, 21106072890000 is an apocalyptic number.
1106072890000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1106072890000 is the 1051700-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1106072890000
1106072890000 is an abundant number, since it is smaller than the sum of its proper divisors (1797267933383).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106072890000 is an frugal number, since it uses more digits than its factorization.
1106072890000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1672 (or 829 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 34.
The spelling of 1106072890000 in words is "one trillion, one hundred six billion, seventy-two million, eight hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •