Base | Representation |
---|---|
bin | 101111001011101010… |
… | …1110001000100011001 |
3 | 100200112101200122000100 |
4 | 1132113111301010121 |
5 | 3130002232012213 |
6 | 114314114130013 |
7 | 10214612645106 |
oct | 1362725610431 |
9 | 320471618010 |
10 | 101323313433 |
11 | 39a75407071 |
12 | 17778b80909 |
13 | 9729a1b044 |
14 | 4c92acdaad |
15 | 29804d2773 |
hex | 1797571119 |
101323313433 has 12 divisors (see below), whose sum is σ = 146374589140. Its totient is φ = 67540248576.
The previous prime is 101323313393. The next prime is 101323313459. The reversal of 101323313433 is 334313323101.
It can be written as a sum of positive squares in 2 ways, for example, as 5463722889 + 95859590544 = 73917^2 + 309612^2 .
It is not a de Polignac number, because 101323313433 - 26 = 101323313369 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101323313397 and 101323313406.
It is not an unprimeable number, because it can be changed into a prime (101323313033) 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 11 ways as a sum of consecutive naturals, for example, 644128 + ... + 785841.
Almost surely, 2101323313433 is an apocalyptic number.
It is an amenable number.
101323313433 is a deficient number, since it is larger than the sum of its proper divisors (45051275707).
101323313433 is a wasteful number, since it uses less digits than its factorization.
101323313433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1437848 (or 1437845 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 101323313433 its reverse (334313323101), we get a palindrome (435636636534).
The spelling of 101323313433 in words is "one hundred one billion, three hundred twenty-three million, three hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •