Base | Representation |
---|---|
bin | 11110010000111010001000… |
… | …001010101010110000101111 |
3 | 122110021112221021222020101221 |
4 | 132100322020022222300233 |
5 | 114421231100134013012 |
6 | 1151030453241044211 |
7 | 40015253243035000 |
oct | 3620721012526057 |
9 | 573245837866357 |
10 | 133103321001007 |
11 | 3945788a788235 |
12 | 12b18394a86667 |
13 | 593678794aa76 |
14 | 24c23411db1a7 |
15 | 105c4c9877507 |
hex | 790e882aac2f |
133103321001007 has 8 divisors (see below), whose sum is σ = 155222531780000. Its totient is φ = 114088560857712.
The previous prime is 133103321000987. The next prime is 133103321001031. The reversal of 133103321001007 is 700100123301331.
It is not a de Polignac number, because 133103321001007 - 211 = 133103320998959 is a prime.
It is a super-2 number, since 2×1331033210010072 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133103321001407) 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, 194028164382 + ... + 194028165067.
It is an arithmetic number, because the mean of its divisors is an integer number (19402816472500).
Almost surely, 2133103321001007 is an apocalyptic number.
133103321001007 is a deficient number, since it is larger than the sum of its proper divisors (22119210778993).
133103321001007 is an frugal number, since it uses more digits than its factorization.
133103321001007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388056329470 (or 388056329456 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 133103321001007 its reverse (700100123301331), we get a palindrome (833203444302338).
The spelling of 133103321001007 in words is "one hundred thirty-three trillion, one hundred three billion, three hundred twenty-one million, one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •