Base | Representation |
---|---|
bin | 1001001101101011100111… |
… | …0011011010010110111001 |
3 | 1022212110222102112100102022 |
4 | 2103122321303122112321 |
5 | 2311440032414134413 |
6 | 33313542331044225 |
7 | 2063625645304601 |
oct | 223327163322671 |
9 | 38773872470368 |
10 | 10130650146233 |
11 | 32564259a1691 |
12 | 117747a2a0675 |
13 | 586415935766 |
14 | 27047cab5c01 |
15 | 1287c4dcc608 |
hex | 936b9cda5b9 |
10130650146233 has 8 divisors (see below), whose sum is σ = 10192976024448. Its totient is φ = 10068326398224.
The previous prime is 10130650146209. The next prime is 10130650146277. The reversal of 10130650146233 is 33264105603101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10130650146233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10130650146193 and 10130650146202.
It is not an unprimeable number, because it can be changed into a prime (10130650143233) 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, 9599135 + ... + 10602107.
It is an arithmetic number, because the mean of its divisors is an integer number (1274122003056).
Almost surely, 210130650146233 is an apocalyptic number.
It is an amenable number.
10130650146233 is a deficient number, since it is larger than the sum of its proper divisors (62325878215).
10130650146233 is a wasteful number, since it uses less digits than its factorization.
10130650146233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065103.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 10130650146233 its reverse (33264105603101), we get a palindrome (43394755749334).
The spelling of 10130650146233 in words is "ten trillion, one hundred thirty billion, six hundred fifty million, one hundred forty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •