Base | Representation |
---|---|
bin | 11100001011011001… |
… | …100110100100100000 |
3 | 2220002121001200021222 |
4 | 130023121212210200 |
5 | 443431021011112 |
6 | 21522135434212 |
7 | 2120526012632 |
oct | 341331464440 |
9 | 86077050258 |
10 | 30256032032 |
11 | 11916817756 |
12 | 5a44825968 |
13 | 2b1243a245 |
14 | 1670454a52 |
15 | bc1350372 |
hex | 70b666920 |
30256032032 has 54 divisors (see below), whose sum is σ = 60377445387. Its totient is φ = 14924826624.
The previous prime is 30256032029. The next prime is 30256032101. The reversal of 30256032032 is 23023065203.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 1054690576 + 29201341456 = 32476^2 + 170884^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=122996.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30256031992 and 30256032010.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 95444738 + ... + 95445054.
Almost surely, 230256032032 is an apocalyptic number.
30256032032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30256032032 is a deficient number, since it is larger than the sum of its proper divisors (30121413355).
30256032032 is an frugal number, since it uses more digits than its factorization.
30256032032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838 (or 416 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 26.
Adding to 30256032032 its reverse (23023065203), we get a palindrome (53279097235).
The spelling of 30256032032 in words is "thirty billion, two hundred fifty-six million, thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •