Base | Representation |
---|---|
bin | 11110011000101110010000… |
… | …100001000110100001111101 |
3 | 122112011220001111221002120020 |
4 | 132120232100201012201331 |
5 | 120004030344443333040 |
6 | 1152121304310442353 |
7 | 40102124003231424 |
oct | 3630562041064175 |
9 | 575156044832506 |
10 | 133640332011645 |
11 | 39644601473828 |
12 | 12ba44849633b9 |
13 | 59752c9820424 |
14 | 2500325a502bb |
15 | 106b459875cd0 |
hex | 798b9084687d |
133640332011645 has 64 divisors (see below), whose sum is σ = 230138505621504. Its totient is φ = 65975459512320.
The previous prime is 133640332011629. The next prime is 133640332011689. The reversal of 133640332011645 is 546110233046331.
It is not a de Polignac number, because 133640332011645 - 24 = 133640332011629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133640332011597 and 133640332011606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 146899044 + ... + 147805986.
It is an arithmetic number, because the mean of its divisors is an integer number (3595914150336).
Almost surely, 2133640332011645 is an apocalyptic number.
133640332011645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
133640332011645 is a deficient number, since it is larger than the sum of its proper divisors (96498173609859).
133640332011645 is a wasteful number, since it uses less digits than its factorization.
133640332011645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 916502.
The product of its (nonzero) digits is 466560, while the sum is 42.
Adding to 133640332011645 its reverse (546110233046331), we get a palindrome (679750565057976).
The spelling of 133640332011645 in words is "one hundred thirty-three trillion, six hundred forty billion, three hundred thirty-two million, eleven thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •