Base | Representation |
---|---|
bin | 11110010000111001111011… |
… | …101110010001100110011011 |
3 | 122110021112101202010122020102 |
4 | 132100321323232101212123 |
5 | 114421230133212400243 |
6 | 1151030420422250015 |
7 | 40015245126364013 |
oct | 3620717356214633 |
9 | 573245352118212 |
10 | 133103112231323 |
11 | 39457792955503 |
12 | 12b18336b8690b |
13 | 5936753612c00 |
14 | 24c23215b4c43 |
15 | 105c4b63899b8 |
hex | 790e7bb9199b |
133103112231323 has 12 divisors (see below), whose sum is σ = 144131195426400. Its totient is φ = 122862885496416.
The previous prime is 133103112231319. The next prime is 133103112231359. The reversal of 133103112231323 is 323132211301331.
It is not a de Polignac number, because 133103112231323 - 22 = 133103112231319 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133103112231823) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8872865 + ... + 18572397.
It is an arithmetic number, because the mean of its divisors is an integer number (12010932952200).
Almost surely, 2133103112231323 is an apocalyptic number.
133103112231323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133103112231323 is a deficient number, since it is larger than the sum of its proper divisors (11028083195077).
133103112231323 is an equidigital number, since it uses as much as digits as its factorization.
133103112231323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9780758 (or 9780745 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 133103112231323 its reverse (323132211301331), we get a palindrome (456235323532654).
The spelling of 133103112231323 in words is "one hundred thirty-three trillion, one hundred three billion, one hundred twelve million, two hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •