Base | Representation |
---|---|
bin | 1100100001001100110… |
… | …11010110000011001101 |
3 | 1112010021021222202121122 |
4 | 12100212123112003031 |
5 | 24021412201311023 |
6 | 525334303410325 |
7 | 43035206563046 |
oct | 6204633260315 |
9 | 1463237882548 |
10 | 430141432013 |
11 | 156470696397 |
12 | 6b4455b39a5 |
13 | 317400c2507 |
14 | 16b673058cd |
15 | b2c7b5d2c8 |
hex | 64266d60cd |
430141432013 has 4 divisors (see below), whose sum is σ = 430446714780. Its totient is φ = 429836149248.
The previous prime is 430141432001. The next prime is 430141432027. The reversal of 430141432013 is 310234141034.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 115109561284 + 315031870729 = 339278^2 + 561277^2 .
It is a cyclic number.
It is not a de Polignac number, because 430141432013 - 24 = 430141431997 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 (430141437013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 152639270 + ... + 152642087.
It is an arithmetic number, because the mean of its divisors is an integer number (107611678695).
Almost surely, 2430141432013 is an apocalyptic number.
It is an amenable number.
430141432013 is a deficient number, since it is larger than the sum of its proper divisors (305282767).
430141432013 is a wasteful number, since it uses less digits than its factorization.
430141432013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305282766.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 430141432013 its reverse (310234141034), we get a palindrome (740375573047).
The spelling of 430141432013 in words is "four hundred thirty billion, one hundred forty-one million, four hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •