Base | Representation |
---|---|
bin | 1001110011001100011… |
… | …11100100010101111100 |
3 | 1012012010210100212102020 |
4 | 10321212033210111330 |
5 | 21004102014244030 |
6 | 414404402200140 |
7 | 33220206425160 |
oct | 4714617442574 |
9 | 1165123325366 |
10 | 336722806140 |
11 | 11a892278066 |
12 | 55313953050 |
13 | 259a2c555b6 |
14 | 1242438cca0 |
15 | 8b5b5ea510 |
hex | 4e663e457c |
336722806140 has 96 divisors (see below), whose sum is σ = 1092273530880. Its totient is φ = 75910887936.
The previous prime is 336722806111. The next prime is 336722806153. The reversal of 336722806140 is 41608227633.
It is a super-2 number, since 2×3367228061402 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 336722806092 and 336722806101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5460580 + ... + 5521899.
It is an arithmetic number, because the mean of its divisors is an integer number (11377849280).
Almost surely, 2336722806140 is an apocalyptic number.
336722806140 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
336722806140 is an abundant number, since it is smaller than the sum of its proper divisors (755550724740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
336722806140 is a wasteful number, since it uses less digits than its factorization.
336722806140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10982571 (or 10982569 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 42.
The spelling of 336722806140 in words is "three hundred thirty-six billion, seven hundred twenty-two million, eight hundred six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •