Base | Representation |
---|---|
bin | 1001110010001111101… |
… | …01000011101011100101 |
3 | 1012010211020012200001020 |
4 | 10321013311003223211 |
5 | 21002030402241013 |
6 | 414242013321353 |
7 | 33201442303161 |
oct | 4710765035345 |
9 | 1163736180036 |
10 | 336212540133 |
11 | 11a650239718 |
12 | 551b0a96259 |
13 | 25921317852 |
14 | 123b66c3ca1 |
15 | 8b2b905623 |
hex | 4e47d43ae5 |
336212540133 has 8 divisors (see below), whose sum is σ = 460399154208. Its totient is φ = 218083809744.
The previous prime is 336212540129. The next prime is 336212540159. The reversal of 336212540133 is 331045212633.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 336212540133 - 22 = 336212540129 is a prime.
It is a super-2 number, since 2×3362125401332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 336212540094 and 336212540103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (336212540123) 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, 1514470791 + ... + 1514471012.
It is an arithmetic number, because the mean of its divisors is an integer number (57549894276).
Almost surely, 2336212540133 is an apocalyptic number.
It is an amenable number.
336212540133 is a deficient number, since it is larger than the sum of its proper divisors (124186614075).
336212540133 is a wasteful number, since it uses less digits than its factorization.
336212540133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3028941843.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 336212540133 its reverse (331045212633), we get a palindrome (667257752766).
The spelling of 336212540133 in words is "three hundred thirty-six billion, two hundred twelve million, five hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •