Base | Representation |
---|---|
bin | 10110111111101011011101… |
… | …110011001000011010000010 |
3 | 111021002020000010110000002201 |
4 | 112333223131303020122002 |
5 | 101223430411401321010 |
6 | 555031511333303414 |
7 | 30205422353564116 |
oct | 2677533563103202 |
9 | 437066003400081 |
10 | 101133021120130 |
11 | 2a25130098749a |
12 | b414310194b6a |
13 | 4457a59183a4c |
14 | 1ad8c15a67746 |
15 | ba5a7e21123a |
hex | 5bfaddcc8682 |
101133021120130 has 16 divisors (see below), whose sum is σ = 191620461070080. Its totient is φ = 38324092213872.
The previous prime is 101133021120127. The next prime is 101133021120139. The reversal of 101133021120130 is 31021120331101.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 101133021120098 and 101133021120107.
It is not an unprimeable number, because it can be changed into a prime (101133021120139) 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, 266139529074 + ... + 266139529453.
It is an arithmetic number, because the mean of its divisors is an integer number (11976278816880).
Almost surely, 2101133021120130 is an apocalyptic number.
101133021120130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101133021120130 is a deficient number, since it is larger than the sum of its proper divisors (90487439949950).
101133021120130 is a wasteful number, since it uses less digits than its factorization.
101133021120130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532279058553.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101133021120130 its reverse (31021120331101), we get a palindrome (132154141451231).
The spelling of 101133021120130 in words is "one hundred one trillion, one hundred thirty-three billion, twenty-one million, one hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •