Base | Representation |
---|---|
bin | 11100011010110000… |
… | …011001010011011001 |
3 | 2220202112211210121200 |
4 | 130122300121103121 |
5 | 444442444241431 |
6 | 22003501424413 |
7 | 2130104606103 |
oct | 343260312331 |
9 | 86675753550 |
10 | 30513665241 |
11 | 11a39194364 |
12 | 5ab6b6b109 |
13 | 2b53923127 |
14 | 169675a573 |
15 | bd8c90ee6 |
hex | 71ac194d9 |
30513665241 has 12 divisors (see below), whose sum is σ = 44099954340. Its totient is φ = 20331061920.
The previous prime is 30513665227. The next prime is 30513665251. The reversal of 30513665241 is 14256631503.
30513665241 is a `hidden beast` number, since 3 + 0 + 51 + 366 + 5 + 241 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 14011693641 + 16501971600 = 118371^2 + 128460^2 .
It is not a de Polignac number, because 30513665241 - 25 = 30513665209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30513665196 and 30513665205.
It is not an unprimeable number, because it can be changed into a prime (30513665251) 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 11 ways as a sum of consecutive naturals, for example, 931470 + ... + 963671.
It is an arithmetic number, because the mean of its divisors is an integer number (3674996195).
Almost surely, 230513665241 is an apocalyptic number.
It is an amenable number.
30513665241 is a deficient number, since it is larger than the sum of its proper divisors (13586289099).
30513665241 is a wasteful number, since it uses less digits than its factorization.
30513665241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1896936 (or 1896933 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 30513665241 in words is "thirty billion, five hundred thirteen million, six hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •