Base | Representation |
---|---|
bin | 11010101010011010… |
… | …01110101001101101 |
3 | 1100221121010112202010 |
4 | 31111031032221231 |
5 | 213303443330013 |
6 | 10324223551433 |
7 | 1014503450130 |
oct | 152515165155 |
9 | 40847115663 |
10 | 14314433133 |
11 | 6086140530 |
12 | 2935a5b579 |
13 | 14717c12a0 |
14 | 99b166217 |
15 | 58ba437c3 |
hex | 35534ea6d |
14314433133 has 32 divisors (see below), whose sum is σ = 25625843712. Its totient is φ = 6864062400.
The previous prime is 14314433131. The next prime is 14314433153. The reversal of 14314433133 is 33133441341.
It is not a de Polignac number, because 14314433133 - 21 = 14314433131 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14314433133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14314433131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2380353 + ... + 2386358.
It is an arithmetic number, because the mean of its divisors is an integer number (800807616).
Almost surely, 214314433133 is an apocalyptic number.
14314433133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
14314433133 is a deficient number, since it is larger than the sum of its proper divisors (11311410579).
14314433133 is a wasteful number, since it uses less digits than its factorization.
14314433133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4766745.
The product of its digits is 15552, while the sum is 30.
Adding to 14314433133 its reverse (33133441341), we get a palindrome (47447874474).
The spelling of 14314433133 in words is "fourteen billion, three hundred fourteen million, four hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •