Base | Representation |
---|---|
bin | 1101110001111010000100… |
… | …00010110100110100111011 |
3 | 10222021212000121111012200002 |
4 | 12320331002002310310323 |
5 | 12432432201142411303 |
6 | 144240332120103215 |
7 | 6245153225560043 |
oct | 670750202646473 |
9 | 128255017435602 |
10 | 30302102310203 |
11 | 972305a8640a9 |
12 | 3494900904b0b |
13 | 13ba625987399 |
14 | 76a8b57ba723 |
15 | 378361d09788 |
hex | 1b8f420b4d3b |
30302102310203 has 8 divisors (see below), whose sum is σ = 30638903193600. Its totient is φ = 29966835827880.
The previous prime is 30302102310199. The next prime is 30302102310217. The reversal of 30302102310203 is 30201320120303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30302102310203 - 22 = 30302102310199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30332102310203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 383560553 + ... + 383639546.
It is an arithmetic number, because the mean of its divisors is an integer number (3829862899200).
Almost surely, 230302102310203 is an apocalyptic number.
30302102310203 is a deficient number, since it is larger than the sum of its proper divisors (336800883397).
30302102310203 is a wasteful number, since it uses less digits than its factorization.
30302102310203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767200537.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30302102310203 its reverse (30201320120303), we get a palindrome (60503422430506).
The spelling of 30302102310203 in words is "thirty trillion, three hundred two billion, one hundred two million, three hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •