Base | Representation |
---|---|
bin | 11110010010100000011111… |
… | …010100111001010111111000 |
3 | 122110200001122010110002022020 |
4 | 132102200133110321113320 |
5 | 114430031144143134222 |
6 | 1151153151422354440 |
7 | 40026224024362551 |
oct | 3622403724712770 |
9 | 573601563402266 |
10 | 133213231224312 |
11 | 3949a461189828 |
12 | 12b3574972ba20 |
13 | 5943c52673565 |
14 | 24c77aa4d1328 |
15 | 10602adb3965c |
hex | 79281f5395f8 |
133213231224312 has 32 divisors (see below), whose sum is σ = 333041122297680. Its totient is φ = 44403337843200.
The previous prime is 133213231224277. The next prime is 133213231224319. The reversal of 133213231224312 is 213422132312331.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133213231224319) 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, 66020689 + ... + 68008512.
Almost surely, 2133213231224312 is an apocalyptic number.
133213231224312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133213231224312 is an abundant number, since it is smaller than the sum of its proper divisors (199827891073368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133213231224312 is a wasteful number, since it uses less digits than its factorization.
133213231224312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134070623 (or 134070619 counting only the distinct ones).
The product of its digits is 31104, while the sum is 33.
Adding to 133213231224312 its reverse (213422132312331), we get a palindrome (346635363536643).
The spelling of 133213231224312 in words is "one hundred thirty-three trillion, two hundred thirteen billion, two hundred thirty-one million, two hundred twenty-four thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •