Base | Representation |
---|---|
bin | 111101100100110000… |
… | …1011110000100100111 |
3 | 110122022100002122200011 |
4 | 1323021201132010213 |
5 | 4131301340410343 |
6 | 140425020031051 |
7 | 12360532365430 |
oct | 1731141360447 |
9 | 418270078604 |
10 | 132230013223 |
11 | 51095439070 |
12 | 21763692487 |
13 | c613bb4199 |
14 | 658571a487 |
15 | 368da0d29d |
hex | 1ec985e127 |
132230013223 has 16 divisors (see below), whose sum is σ = 164945652480. Its totient is φ = 102981715200.
The previous prime is 132230013211. The next prime is 132230013259. The reversal of 132230013223 is 322310032231.
It is a de Polignac number, because none of the positive numbers 2k-132230013223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132230013194 and 132230013203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132230013523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309093 + ... + 599998.
It is an arithmetic number, because the mean of its divisors is an integer number (10309103280).
Almost surely, 2132230013223 is an apocalyptic number.
132230013223 is a deficient number, since it is larger than the sum of its proper divisors (32715639257).
132230013223 is a wasteful number, since it uses less digits than its factorization.
132230013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910998.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 132230013223 its reverse (322310032231), we get a palindrome (454540045454).
It can be divided in two parts, 1322300 and 13223, that multiplied together give a square (17484772900 = 1322302).
The spelling of 132230013223 in words is "one hundred thirty-two billion, two hundred thirty million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •