Base | Representation |
---|---|
bin | 11101110001101101100… |
… | …01110000111000111110 |
3 | 10121210212002002200022120 |
4 | 32320312301300320332 |
5 | 113230323013401142 |
6 | 2102003154423410 |
7 | 133626616656003 |
oct | 16706661607076 |
9 | 3553762080276 |
10 | 1023121231422 |
11 | 3649a3298314 |
12 | 146355291b66 |
13 | 756314c3274 |
14 | 3773b0918aa |
15 | 1b9315217ec |
hex | ee36c70e3e |
1023121231422 has 8 divisors (see below), whose sum is σ = 2046242462856. Its totient is φ = 341040410472.
The previous prime is 1023121231403. The next prime is 1023121231453. The reversal of 1023121231422 is 2241321213201.
It is a sphenic number, since it is the product of 3 distinct primes.
1023121231422 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1023121231392 and 1023121231401.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 85260102613 + ... + 85260102624.
It is an arithmetic number, because the mean of its divisors is an integer number (255780307857).
Almost surely, 21023121231422 is an apocalyptic number.
1023121231422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023121231422 is a wasteful number, since it uses less digits than its factorization.
1023121231422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170520205242.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1023121231422 its reverse (2241321213201), we get a palindrome (3264442444623).
The spelling of 1023121231422 in words is "one trillion, twenty-three billion, one hundred twenty-one million, two hundred thirty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •