Base | Representation |
---|---|
bin | 1100100001001101001… |
… | …11000110000001110000 |
3 | 1112010021111210020201101 |
4 | 12100212213012001300 |
5 | 24021413443341422 |
6 | 525334453414144 |
7 | 43035245011660 |
oct | 6204647060160 |
9 | 1463244706641 |
10 | 430144512112 |
11 | 1564723aa527 |
12 | 6b44663a354 |
13 | 31740930463 |
14 | 16b678a81a0 |
15 | b2c806ac27 |
hex | 64269c6070 |
430144512112 has 160 divisors (see below), whose sum is σ = 1025877196800. Its totient is φ = 170603345664.
The previous prime is 430144512059. The next prime is 430144512163. The reversal of 430144512112 is 211215441034.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56305189 + ... + 56312827.
It is an arithmetic number, because the mean of its divisors is an integer number (6411732480).
Almost surely, 2430144512112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 430144512112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (512938598400).
430144512112 is an abundant number, since it is smaller than the sum of its proper divisors (595732684688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
430144512112 is a wasteful number, since it uses less digits than its factorization.
430144512112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8283 (or 8277 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 430144512112 its reverse (211215441034), we get a palindrome (641359953146).
The spelling of 430144512112 in words is "four hundred thirty billion, one hundred forty-four million, five hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •