Base | Representation |
---|---|
bin | 110011010111110010… |
… | …1110010101110110001 |
3 | 101112202101201212012121 |
4 | 1212233211302232301 |
5 | 3301413421233241 |
6 | 122402542354241 |
7 | 10653556253242 |
oct | 1465745625661 |
9 | 345671655177 |
10 | 110320102321 |
11 | 42871904790 |
12 | 19469b8b981 |
13 | a531915870 |
14 | 54a790acc9 |
15 | 2d0a277ad1 |
hex | 19af972bb1 |
110320102321 has 16 divisors (see below), whose sum is σ = 130627381248. Its totient is φ = 91847347200.
The previous prime is 110320102303. The next prime is 110320102381. The reversal of 110320102321 is 123201023011.
It is a cyclic number.
It is not a de Polignac number, because 110320102321 - 215 = 110320069553 is a prime.
It is a super-2 number, since 2×1103201023212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110320102295 and 110320102304.
It is not an unprimeable number, because it can be changed into a prime (110320102381) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3019120 + ... + 3055441.
It is an arithmetic number, because the mean of its divisors is an integer number (8164211328).
Almost surely, 2110320102321 is an apocalyptic number.
110320102321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110320102321 is a deficient number, since it is larger than the sum of its proper divisors (20307278927).
110320102321 is a wasteful number, since it uses less digits than its factorization.
110320102321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6074712.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 110320102321 its reverse (123201023011), we get a palindrome (233521125332).
The spelling of 110320102321 in words is "one hundred ten billion, three hundred twenty million, one hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •