Base | Representation |
---|---|
bin | 110100101000010010… |
… | …0111111000001110001 |
3 | 101210201121222210220200 |
4 | 1221100210333001301 |
5 | 3322431340203241 |
6 | 123530544425413 |
7 | 11110523560464 |
oct | 1512044770161 |
9 | 353647883820 |
10 | 113021022321 |
11 | 43a28469979 |
12 | 19aa2618269 |
13 | a872361c8c |
14 | 56824dd2db |
15 | 2e174404b6 |
hex | 1a5093f071 |
113021022321 has 24 divisors (see below), whose sum is σ = 171978275040. Its totient is φ = 71326267200.
The previous prime is 113021022313. The next prime is 113021022421. The reversal of 113021022321 is 123220120311.
113021022321 is a `hidden beast` number, since 1 + 130 + 210 + 2 + 2 + 321 = 666.
It is not a de Polignac number, because 113021022321 - 23 = 113021022313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113021022294 and 113021022303.
It is not an unprimeable number, because it can be changed into a prime (113021022221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35220 + ... + 476741.
It is an arithmetic number, because the mean of its divisors is an integer number (7165761460).
Almost surely, 2113021022321 is an apocalyptic number.
It is an amenable number.
113021022321 is a deficient number, since it is larger than the sum of its proper divisors (58957252719).
113021022321 is a wasteful number, since it uses less digits than its factorization.
113021022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513277 (or 513274 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 113021022321 its reverse (123220120311), we get a palindrome (236241142632).
The spelling of 113021022321 in words is "one hundred thirteen billion, twenty-one million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •