Base | Representation |
---|---|
bin | 11110010011110001011001… |
… | …110100110101110111011001 |
3 | 122110222100212222222221122002 |
4 | 132103301121310311313121 |
5 | 114432442112134214001 |
6 | 1151301120455410345 |
7 | 40035421020110000 |
oct | 3623613164656731 |
9 | 573870788887562 |
10 | 133300112023001 |
11 | 395232951237a0 |
12 | 12b4a5559839b5 |
13 | 594c1ba1a6a91 |
14 | 24cba8d037c37 |
15 | 106269622846b |
hex | 793c59d35dd9 |
133300112023001 has 40 divisors (see below), whose sum is σ = 170049487557600. Its totient is φ = 103622308278720.
The previous prime is 133300112022937. The next prime is 133300112023033. The reversal of 133300112023001 is 100320211003331.
It is not a de Polignac number, because 133300112023001 - 26 = 133300112022937 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133300112023051) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5043365 + ... + 17089053.
It is an arithmetic number, because the mean of its divisors is an integer number (4251237188940).
Almost surely, 2133300112023001 is an apocalyptic number.
133300112023001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133300112023001 is a deficient number, since it is larger than the sum of its proper divisors (36749375534599).
133300112023001 is an equidigital number, since it uses as much as digits as its factorization.
133300112023001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12046147 (or 12046126 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 133300112023001 its reverse (100320211003331), we get a palindrome (233620323026332).
The spelling of 133300112023001 in words is "one hundred thirty-three trillion, three hundred billion, one hundred twelve million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •