Base | Representation |
---|---|
bin | 10110111111100000010011… |
… | …000101001000110110111101 |
3 | 111021001002001110021122112010 |
4 | 112333200103011020312331 |
5 | 101223231332203144013 |
6 | 555022205425001433 |
7 | 30204516252060405 |
oct | 2677402305106675 |
9 | 437032043248463 |
10 | 101121030131133 |
11 | 2a24720831aa31 |
12 | b411b24483279 |
13 | 4456897b5589c |
14 | 1ad83d9313805 |
15 | ba55cb6707c3 |
hex | 5bf813148dbd |
101121030131133 has 8 divisors (see below), whose sum is σ = 135857261856096. Its totient is φ = 66899409246800.
The previous prime is 101121030131119. The next prime is 101121030131171. The reversal of 101121030131133 is 331131030121101.
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 101121030131133 - 213 = 101121030122941 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121030181133) 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, 128652709698 + ... + 128652710483.
It is an arithmetic number, because the mean of its divisors is an integer number (16982157732012).
Almost surely, 2101121030131133 is an apocalyptic number.
It is an amenable number.
101121030131133 is a deficient number, since it is larger than the sum of its proper divisors (34736231724963).
101121030131133 is a wasteful number, since it uses less digits than its factorization.
101121030131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257305420315.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 101121030131133 its reverse (331131030121101), we get a palindrome (432252060252234).
The spelling of 101121030131133 in words is "one hundred one trillion, one hundred twenty-one billion, thirty million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •