Base | Representation |
---|---|
bin | 11100000010010011… |
… | …110100001011111111 |
3 | 2212200222002021010011 |
4 | 130002103310023333 |
5 | 443123000114444 |
6 | 21455050524051 |
7 | 2113664461300 |
oct | 340223641377 |
9 | 85628067104 |
10 | 30103519999 |
11 | 1184871a153 |
12 | 5a01736627 |
13 | 2ab996bb37 |
14 | 16580b47a7 |
15 | bb2c76734 |
hex | 7024f42ff |
30103519999 has 24 divisors (see below), whose sum is σ = 35410592448. Its totient is φ = 25514496000.
The previous prime is 30103519997. The next prime is 30103520011. The reversal of 30103519999 is 99991530103.
It is not a de Polignac number, because 30103519999 - 21 = 30103519997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30103519997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7521999 + ... + 7525999.
It is an arithmetic number, because the mean of its divisors is an integer number (1475441352).
Almost surely, 230103519999 is an apocalyptic number.
30103519999 is a deficient number, since it is larger than the sum of its proper divisors (5307072449).
30103519999 is a wasteful number, since it uses less digits than its factorization.
30103519999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5695 (or 5688 counting only the distinct ones).
The product of its (nonzero) digits is 295245, while the sum is 49.
The spelling of 30103519999 in words is "thirty billion, one hundred three million, five hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •