Base | Representation |
---|---|
bin | 11101100111011001000100… |
… | …110011010100001100000111 |
3 | 122002011210212121210222020221 |
4 | 131213121010303110030013 |
5 | 114033010140111134343 |
6 | 1141004102100405211 |
7 | 36302163443060035 |
oct | 3547310463241407 |
9 | 562153777728227 |
10 | 130250332521223 |
11 | 385579460a8602 |
12 | 127374789a6807 |
13 | 578a7274ba5a5 |
14 | 2424214c0b555 |
15 | 100d19b6975ed |
hex | 767644cd4307 |
130250332521223 has 16 divisors (see below), whose sum is σ = 132558703200000. Its totient is φ = 127945350350272.
The previous prime is 130250332521217. The next prime is 130250332521233. The reversal of 130250332521223 is 322125233052031.
It is a cyclic number.
It is not a de Polignac number, because 130250332521223 - 217 = 130250332390151 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 (130250332521233) 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 15 ways as a sum of consecutive naturals, for example, 506486928 + ... + 506744026.
It is an arithmetic number, because the mean of its divisors is an integer number (8284918950000).
Almost surely, 2130250332521223 is an apocalyptic number.
130250332521223 is a deficient number, since it is larger than the sum of its proper divisors (2308370678777).
130250332521223 is a wasteful number, since it uses less digits than its factorization.
130250332521223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263654.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 130250332521223 its reverse (322125233052031), we get a palindrome (452375565573254).
The spelling of 130250332521223 in words is "one hundred thirty trillion, two hundred fifty billion, three hundred thirty-two million, five hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •