Base | Representation |
---|---|
bin | 11100001001011011… |
… | …101000100101010101 |
3 | 2220000021220222202200 |
4 | 130021123220211111 |
5 | 443344042311013 |
6 | 21514555555113 |
7 | 2116645230111 |
oct | 341133504525 |
9 | 86007828680 |
10 | 30223010133 |
11 | 118aa112928 |
12 | 5a3575ba99 |
13 | 2b08647964 |
14 | 1669cda741 |
15 | bbd4cae73 |
hex | 7096e8955 |
30223010133 has 12 divisors (see below), whose sum is σ = 43765427628. Its totient is φ = 20097918720.
The previous prime is 30223010123. The next prime is 30223010219. The reversal of 30223010133 is 33101032203.
30223010133 is a `hidden beast` number, since 302 + 230 + 1 + 0 + 133 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19953822564 + 10269187569 = 141258^2 + 101337^2 .
It is not a de Polignac number, because 30223010133 - 28 = 30223009877 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30223010113) 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, 4225788 + ... + 4232933.
It is an arithmetic number, because the mean of its divisors is an integer number (3647118969).
Almost surely, 230223010133 is an apocalyptic number.
It is an amenable number.
30223010133 is a deficient number, since it is larger than the sum of its proper divisors (13542417495).
30223010133 is a wasteful number, since it uses less digits than its factorization.
30223010133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8459124 (or 8459121 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 30223010133 its reverse (33101032203), we get a palindrome (63324042336).
The spelling of 30223010133 in words is "thirty billion, two hundred twenty-three million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •