Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0110100111001001001 |
3 | 110110010222010010112121 |
4 | 1321102110310321021 |
5 | 4113202413210441 |
6 | 135454341211241 |
7 | 12260140343614 |
oct | 1712224647111 |
9 | 413128103477 |
10 | 130230210121 |
11 | 50259616430 |
12 | 212a5a00b21 |
13 | c3857a863b |
14 | 6435cb317b |
15 | 35c3188dd1 |
hex | 1e52534e49 |
130230210121 has 8 divisors (see below), whose sum is σ = 143475948288. Its totient is φ = 117218910000.
The previous prime is 130230210119. The next prime is 130230210139. The reversal of 130230210121 is 121012032031.
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 130230210121 - 21 = 130230210119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130230210095 and 130230210104.
It is not an unprimeable number, because it can be changed into a prime (130230210101) 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, 58608345 + ... + 58610566.
It is an arithmetic number, because the mean of its divisors is an integer number (17934493536).
Almost surely, 2130230210121 is an apocalyptic number.
130230210121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130230210121 is a deficient number, since it is larger than the sum of its proper divisors (13245738167).
130230210121 is a wasteful number, since it uses less digits than its factorization.
130230210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117219023.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130230210121 its reverse (121012032031), we get a palindrome (251242242152).
The spelling of 130230210121 in words is "one hundred thirty billion, two hundred thirty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •