Base | Representation |
---|---|
bin | 11100010101111010… |
… | …100011101100000100 |
3 | 2220112220000021211201 |
4 | 130111322203230010 |
5 | 444311201140030 |
6 | 21551440512244 |
7 | 2125100333011 |
oct | 342572435404 |
9 | 86486007751 |
10 | 30432443140 |
11 | 119a7358a60 |
12 | 5a9391b684 |
13 | 2b3cb55708 |
14 | 1689a56708 |
15 | bd1a9a2ca |
hex | 715ea3b04 |
30432443140 has 48 divisors (see below), whose sum is σ = 69857928000. Its totient is φ = 11044126080.
The previous prime is 30432443137. The next prime is 30432443141. The reversal of 30432443140 is 4134423403.
It is a super-2 number, since 2×304324431402 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30432443099 and 30432443108.
It is not an unprimeable number, because it can be changed into a prime (30432443141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28827 + ... + 248386.
It is an arithmetic number, because the mean of its divisors is an integer number (1455373500).
Almost surely, 230432443140 is an apocalyptic number.
It is an amenable number.
30432443140 is an abundant number, since it is smaller than the sum of its proper divisors (39425484860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30432443140 is a wasteful number, since it uses less digits than its factorization.
30432443140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277732 (or 277730 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 30432443140 its reverse (4134423403), we get a palindrome (34566866543).
The spelling of 30432443140 in words is "thirty billion, four hundred thirty-two million, four hundred forty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •