Base | Representation |
---|---|
bin | 110000111000101011010010… |
… | …1001001001001101011011101 |
3 | 2002101111210100111210020211121 |
4 | 1201301112211021021223131 |
5 | 422330123104410210323 |
6 | 4122312110313450541 |
7 | 156400422462140161 |
oct | 14161264511115335 |
9 | 2071453314706747 |
10 | 430002011413213 |
11 | 11501491334a218 |
12 | 4028932b710a51 |
13 | 155c20285cc225 |
14 | 78282cbbc0ca1 |
15 | 34aa5147c1a5d |
hex | 18715a5249add |
430002011413213 has 32 divisors (see below), whose sum is σ = 433208473776000. Its totient is φ = 426813108793344.
The previous prime is 430002011413201. The next prime is 430002011413259. The reversal of 430002011413213 is 312314110200034.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-430002011413213 is a prime.
It is a super-2 number, since 2×4300020114132132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (430002011413613) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 161837413581 + ... + 161837416237.
It is an arithmetic number, because the mean of its divisors is an integer number (13537764805500).
Almost surely, 2430002011413213 is an apocalyptic number.
It is an amenable number.
430002011413213 is a deficient number, since it is larger than the sum of its proper divisors (3206462362787).
430002011413213 is a wasteful number, since it uses less digits than its factorization.
430002011413213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5629.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 430002011413213 its reverse (312314110200034), we get a palindrome (742316121613247).
The spelling of 430002011413213 in words is "four hundred thirty trillion, two billion, eleven million, four hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •