Base | Representation |
---|---|
bin | 1100100111010010101… |
… | …00100100001011101101 |
3 | 1112102201011122210112121 |
4 | 12103221110210023231 |
5 | 24100111232241023 |
6 | 531034550232541 |
7 | 43212222342253 |
oct | 6235124441355 |
9 | 1472634583477 |
10 | 433411212013 |
11 | 15789936a50a |
12 | 6bbb8655751 |
13 | 31b41653690 |
14 | 16d976965d3 |
15 | b419c41d5d |
hex | 64e95242ed |
433411212013 has 16 divisors (see below), whose sum is σ = 468880196400. Its totient is φ = 398250353664.
The previous prime is 433411212007. The next prime is 433411212049. The reversal of 433411212013 is 310212114334.
It can be written as a sum of positive squares in 8 ways, for example, as 16615725604 + 416795486409 = 128902^2 + 645597^2 .
It is a cyclic number.
It is not a de Polignac number, because 433411212013 - 233 = 424821277421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (433411212713) 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 15 ways as a sum of consecutive naturals, for example, 2609895 + ... + 2770987.
It is an arithmetic number, because the mean of its divisors is an integer number (29305012275).
Almost surely, 2433411212013 is an apocalyptic number.
It is an amenable number.
433411212013 is a deficient number, since it is larger than the sum of its proper divisors (35468984387).
433411212013 is a wasteful number, since it uses less digits than its factorization.
433411212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162048.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 433411212013 its reverse (310212114334), we get a palindrome (743623326347).
The spelling of 433411212013 in words is "four hundred thirty-three billion, four hundred eleven million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •