Base | Representation |
---|---|
bin | 111110000010100100… |
… | …0101010011010001011 |
3 | 110201220001000111222000 |
4 | 1330011020222122023 |
5 | 4140323404034430 |
6 | 141112144202043 |
7 | 12424365350136 |
oct | 1740510523213 |
9 | 421801014860 |
10 | 133230143115 |
11 | 51558a404a3 |
12 | 219a2609323 |
13 | c743168514 |
14 | 663c49d21d |
15 | 36eb717e60 |
hex | 1f0522a68b |
133230143115 has 32 divisors (see below), whose sum is σ = 238718607360. Its totient is φ = 70496570592.
The previous prime is 133230143087. The next prime is 133230143191. The reversal of 133230143115 is 511341032331.
133230143115 is a `hidden beast` number, since 1 + 332 + 3 + 0 + 14 + 311 + 5 = 666.
It is not a de Polignac number, because 133230143115 - 26 = 133230143051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3868249 + ... + 3902538.
It is an arithmetic number, because the mean of its divisors is an integer number (7459956480).
Almost surely, 2133230143115 is an apocalyptic number.
133230143115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
133230143115 is a deficient number, since it is larger than the sum of its proper divisors (105488464245).
133230143115 is a wasteful number, since it uses less digits than its factorization.
133230143115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7770928 (or 7770922 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 133230143115 its reverse (511341032331), we get a palindrome (644571175446).
The spelling of 133230143115 in words is "one hundred thirty-three billion, two hundred thirty million, one hundred forty-three thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •