Base | Representation |
---|---|
bin | 1100011010101001100… |
… | …0110000010000010101 |
3 | 202101121002012000210021 |
4 | 3012222120300100111 |
5 | 11443330333411313 |
6 | 241554424425141 |
7 | 21261033124336 |
oct | 3065230602025 |
9 | 671532160707 |
10 | 213312013333 |
11 | 82513085911 |
12 | 354119181b1 |
13 | 17166236a43 |
14 | a47806a28d |
15 | 5836ea978d |
hex | 31aa630415 |
213312013333 has 2 divisors, whose sum is σ = 213312013334. Its totient is φ = 213312013332.
The previous prime is 213312013319. The next prime is 213312013351. The reversal of 213312013333 is 333310213312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182552816644 + 30759196689 = 427262^2 + 175383^2 .
It is a cyclic number.
It is not a de Polignac number, because 213312013333 - 217 = 213311882261 is a prime.
It is a super-4 number, since 4×2133120133334 (a number of 46 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213312013298 and 213312013307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213312013373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106656006666 + 106656006667.
It is an arithmetic number, because the mean of its divisors is an integer number (106656006667).
Almost surely, 2213312013333 is an apocalyptic number.
It is an amenable number.
213312013333 is a deficient number, since it is larger than the sum of its proper divisors (1).
213312013333 is an equidigital number, since it uses as much as digits as its factorization.
213312013333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 213312013333 its reverse (333310213312), we get a palindrome (546622226645).
The spelling of 213312013333 in words is "two hundred thirteen billion, three hundred twelve million, thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •