Base | Representation |
---|---|
bin | 101111001011101010… |
… | …0101011111001110101 |
3 | 100200112101011020101202 |
4 | 1132113110223321311 |
5 | 3130002143431013 |
6 | 114314104102245 |
7 | 10214610355133 |
oct | 1362724537165 |
9 | 320471136352 |
10 | 101323030133 |
11 | 39a75233236 |
12 | 17778a64985 |
13 | 972994c100 |
14 | 4c92a58753 |
15 | 2980478858 |
hex | 179752be75 |
101323030133 has 12 divisors (see below), whose sum is σ = 113255906688. Its totient is φ = 90511883280.
The previous prime is 101323030111. The next prime is 101323030189. The reversal of 101323030133 is 331030323101.
It is not a de Polignac number, because 101323030133 - 212 = 101323026037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101323030433) 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 11 ways as a sum of consecutive naturals, for example, 9664835 + ... + 9675312.
It is an arithmetic number, because the mean of its divisors is an integer number (9437992224).
Almost surely, 2101323030133 is an apocalyptic number.
101323030133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101323030133 is a deficient number, since it is larger than the sum of its proper divisors (11932876555).
101323030133 is a wasteful number, since it uses less digits than its factorization.
101323030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19340204 (or 19340191 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 101323030133 its reverse (331030323101), we get a palindrome (432353353234).
The spelling of 101323030133 in words is "one hundred one billion, three hundred twenty-three million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •