Base | Representation |
---|---|
bin | 1101110000100000011110… |
… | …01011100100001100011111 |
3 | 10222010020212120122022020110 |
4 | 12320100033023210030133 |
5 | 12431140200101314403 |
6 | 144202255301221103 |
7 | 6241531300456311 |
oct | 670201713441437 |
9 | 128106776568213 |
10 | 30254004323103 |
11 | 97047187a1540 |
12 | 3487518a01793 |
13 | 13b5c2bca44a2 |
14 | 7684319197b1 |
15 | 376e9941e103 |
hex | 1b840f2e431f |
30254004323103 has 8 divisors (see below), whose sum is σ = 44005824470016. Its totient is φ = 18335760195800.
The previous prime is 30254004323093. The next prime is 30254004323149. The reversal of 30254004323103 is 30132340045203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30254004323103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30254004328103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 458394004863 + ... + 458394004928.
It is an arithmetic number, because the mean of its divisors is an integer number (5500728058752).
Almost surely, 230254004323103 is an apocalyptic number.
30254004323103 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30254004323103 is a deficient number, since it is larger than the sum of its proper divisors (13751820146913).
30254004323103 is a wasteful number, since it uses less digits than its factorization.
30254004323103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 916788009805.
The product of its (nonzero) digits is 25920, while the sum is 30.
Adding to 30254004323103 its reverse (30132340045203), we get a palindrome (60386344368306).
The spelling of 30254004323103 in words is "thirty trillion, two hundred fifty-four billion, four million, three hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •