Base | Representation |
---|---|
bin | 1001001101110001110101… |
… | …1010010111001101010100 |
3 | 1022212122021220002211020121 |
4 | 2103130131122113031110 |
5 | 2312001443223120312 |
6 | 33314420225441324 |
7 | 2064015240012106 |
oct | 223343532271524 |
9 | 38778256084217 |
10 | 10132321301332 |
11 | 32571032531aa |
12 | 1177865aa0244 |
13 | 586620c22a29 |
14 | 27059aa0d576 |
15 | 128871984707 |
hex | 9371d697354 |
10132321301332 has 6 divisors (see below), whose sum is σ = 17731562277338. Its totient is φ = 5066160650664.
The previous prime is 10132321301287. The next prime is 10132321301339. The reversal of 10132321301332 is 23310312323101.
It can be written as a sum of positive squares in only one way, i.e., 5559720704836 + 4572600596496 = 2357906^2 + 2138364^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10132321301297 and 10132321301306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132321301339) 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 as a sum of consecutive naturals, namely, 1266540162663 + ... + 1266540162670.
Almost surely, 210132321301332 is an apocalyptic number.
It is an amenable number.
10132321301332 is a deficient number, since it is larger than the sum of its proper divisors (7599240976006).
10132321301332 is a wasteful number, since it uses less digits than its factorization.
10132321301332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2533080325337 (or 2533080325335 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10132321301332 its reverse (23310312323101), we get a palindrome (33442633624433).
The spelling of 10132321301332 in words is "ten trillion, one hundred thirty-two billion, three hundred twenty-one million, three hundred one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •