Base | Representation |
---|---|
bin | 100010011100110000101111… |
… | …1001110001110001101011101 |
3 | 1110201220102220212210120002021 |
4 | 1010321201133032032031131 |
5 | 304204140211314344013 |
6 | 2552245305344300141 |
7 | 120553324211043520 |
oct | 10471413716161535 |
9 | 1421812825716067 |
10 | 303020130231133 |
11 | 8860812a884857 |
12 | 29b9b3b8611651 |
13 | 100108a25a9393 |
14 | 54b8377034bb7 |
15 | 25073b0495a8d |
hex | 113985f38e35d |
303020130231133 has 32 divisors (see below), whose sum is σ = 352760480768000. Its totient is φ = 254933733390336.
The previous prime is 303020130231109. The next prime is 303020130231149. The reversal of 303020130231133 is 331132031020303.
It is a de Polignac number, because none of the positive numbers 2k-303020130231133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 303020130231098 and 303020130231107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303020130232133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 125690110 + ... + 128078272.
It is an arithmetic number, because the mean of its divisors is an integer number (11023765024000).
Almost surely, 2303020130231133 is an apocalyptic number.
It is an amenable number.
303020130231133 is a deficient number, since it is larger than the sum of its proper divisors (49740350536867).
303020130231133 is a wasteful number, since it uses less digits than its factorization.
303020130231133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2389601.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 303020130231133 its reverse (331132031020303), we get a palindrome (634152161251436).
The spelling of 303020130231133 in words is "three hundred three trillion, twenty billion, one hundred thirty million, two hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •