Base | Representation |
---|---|
bin | 1111011111111… |
… | …11111010111101 |
3 | 100001122212011102 |
4 | 13233333322331 |
5 | 231241214401 |
6 | 20522502445 |
7 | 3136115045 |
oct | 757777275 |
9 | 301585142 |
10 | 130023101 |
11 | 6743830a |
12 | 37664a25 |
13 | 20c26160 |
14 | 133a8725 |
15 | b63556b |
hex | 7bffebd |
130023101 has 4 divisors (see below), whose sum is σ = 140024892. Its totient is φ = 120021312.
The previous prime is 130023097. The next prime is 130023107. The reversal of 130023101 is 101320031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 73788100 + 56235001 = 8590^2 + 7499^2 .
It is a cyclic number.
It is not a de Polignac number, because 130023101 - 22 = 130023097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130023107) 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 3 ways as a sum of consecutive naturals, for example, 5000876 + ... + 5000901.
It is an arithmetic number, because the mean of its divisors is an integer number (35006223).
Almost surely, 2130023101 is an apocalyptic number.
It is an amenable number.
130023101 is a deficient number, since it is larger than the sum of its proper divisors (10001791).
130023101 is a wasteful number, since it uses less digits than its factorization.
130023101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001790.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 130023101 is about 11402.7672518560. The cubic root of 130023101 is about 506.6097065372.
Adding to 130023101 its reverse (101320031), we get a palindrome (231343132).
The spelling of 130023101 in words is "one hundred thirty million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •