Base | Representation |
---|---|
bin | 11110010001001001110010… |
… | …000100010011010000011101 |
3 | 122110100011022202021001112010 |
4 | 132101021302010103100131 |
5 | 114422020011301233201 |
6 | 1151042313222301433 |
7 | 40016416631036136 |
oct | 3621116204232035 |
9 | 573304282231463 |
10 | 133120130102301 |
11 | 39463a2600a891 |
12 | 12b1b6a6287879 |
13 | 5938236222654 |
14 | 24c30977c6c8d |
15 | 105cb603e1bd6 |
hex | 79127211341d |
133120130102301 has 8 divisors (see below), whose sum is σ = 177505315359424. Its totient is φ = 88740849123360.
The previous prime is 133120130102299. The next prime is 133120130102327. The reversal of 133120130102301 is 103201031021331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133120130102301 - 21 = 133120130102299 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 (133120130102381) 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, 1476016936 + ... + 1476107121.
It is an arithmetic number, because the mean of its divisors is an integer number (22188164419928).
Almost surely, 2133120130102301 is an apocalyptic number.
It is an amenable number.
133120130102301 is a deficient number, since it is larger than the sum of its proper divisors (44385185257123).
133120130102301 is a wasteful number, since it uses less digits than its factorization.
133120130102301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2952139091.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 133120130102301 its reverse (103201031021331), we get a palindrome (236321161123632).
The spelling of 133120130102301 in words is "one hundred thirty-three trillion, one hundred twenty billion, one hundred thirty million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •