Base | Representation |
---|---|
bin | 1111110110110… |
… | …10001100110011 |
3 | 100021021211100102 |
4 | 13323122030303 |
5 | 233022424243 |
6 | 21110543015 |
7 | 3203413601 |
oct | 773321463 |
9 | 307254312 |
10 | 133014323 |
11 | 690a06a2 |
12 | 38667a6b |
13 | 21732800 |
14 | 13946871 |
15 | ba269b8 |
hex | 7eda333 |
133014323 has 6 divisors (see below), whose sum is σ = 144033444. Its totient is φ = 122782296.
The previous prime is 133014319. The next prime is 133014347. The reversal of 133014323 is 323410331.
It is not a de Polignac number, because 133014323 - 22 = 133014319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133014295 and 133014304.
It is not an unprimeable number, because it can be changed into a prime (133014023) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 393365 + ... + 393702.
It is an arithmetic number, because the mean of its divisors is an integer number (24005574).
Almost surely, 2133014323 is an apocalyptic number.
133014323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133014323 is a deficient number, since it is larger than the sum of its proper divisors (11019121).
133014323 is an equidigital number, since it uses as much as digits as its factorization.
133014323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787093 (or 787080 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 133014323 is about 11533.1835587577. The cubic root of 133014323 is about 510.4651951779.
Adding to 133014323 its reverse (323410331), we get a palindrome (456424654).
The spelling of 133014323 in words is "one hundred thirty-three million, fourteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •