Base | Representation |
---|---|
bin | 10000010110000100101… |
… | …010101000011010000001 |
3 | 10222101012120222100022221 |
4 | 100112010222220122001 |
5 | 121400314312413241 |
6 | 2215555132131041 |
7 | 144102150306154 |
oct | 20260452503201 |
9 | 3871176870287 |
10 | 1123212232321 |
11 | 3a3396028773 |
12 | 161829606a81 |
13 | 81bc2b1539a |
14 | 3c51423dc9b |
15 | 1e33d7345d1 |
hex | 10584aa8681 |
1123212232321 has 4 divisors (see below), whose sum is σ = 1131410861892. Its totient is φ = 1115013602752.
The previous prime is 1123212232249. The next prime is 1123212232349. The reversal of 1123212232321 is 1232322123211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 473221543921 + 649990688400 = 687911^2 + 806220^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123212232321 - 27 = 1123212232193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123212232721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4099314580 + ... + 4099314853.
It is an arithmetic number, because the mean of its divisors is an integer number (282852715473).
Almost surely, 21123212232321 is an apocalyptic number.
It is an amenable number.
1123212232321 is a deficient number, since it is larger than the sum of its proper divisors (8198629571).
1123212232321 is an equidigital number, since it uses as much as digits as its factorization.
1123212232321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8198629570.
The product of its digits is 1728, while the sum is 25.
Adding to 1123212232321 its reverse (1232322123211), we get a palindrome (2355534355532).
The spelling of 1123212232321 in words is "one trillion, one hundred twenty-three billion, two hundred twelve million, two hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •