Base | Representation |
---|---|
bin | 1001001101110001110011… |
… | …1011111111100110100001 |
3 | 1022212122021100010100210100 |
4 | 2103130130323333212201 |
5 | 2312001434203342241 |
6 | 33314415343053013 |
7 | 2064015112234134 |
oct | 223343473774641 |
9 | 38778240110710 |
10 | 10132313340321 |
11 | 32570a9805a57 |
12 | 11778632a1169 |
13 | 58661c396283 |
14 | 27059993a21b |
15 | 128870e109b6 |
hex | 9371ceff9a1 |
10132313340321 has 6 divisors (see below), whose sum is σ = 14635563713810. Its totient is φ = 6754875560208.
The previous prime is 10132313340301. The next prime is 10132313340337. The reversal of 10132313340321 is 12304331323101.
10132313340321 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 2 + 3 + 1 + 334 + 0 + 321 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9502028191296 + 630285149025 = 3082536^2 + 793905^2 .
It is not a de Polignac number, because 10132313340321 - 26 = 10132313340257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132313340301) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 562906296676 + ... + 562906296693.
Almost surely, 210132313340321 is an apocalyptic number.
It is an amenable number.
10132313340321 is a deficient number, since it is larger than the sum of its proper divisors (4503250373489).
10132313340321 is a wasteful number, since it uses less digits than its factorization.
10132313340321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1125812593375 (or 1125812593372 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 10132313340321 its reverse (12304331323101), we get a palindrome (22436644663422).
The spelling of 10132313340321 in words is "ten trillion, one hundred thirty-two billion, three hundred thirteen million, three hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •