Base | Representation |
---|---|
bin | 11101110001100011111… |
… | …01000111001001111010 |
3 | 10121210122102211221212202 |
4 | 32320301331013021322 |
5 | 113230141310220442 |
6 | 2101551144310202 |
7 | 133624615146002 |
oct | 16706175071172 |
9 | 3553572757782 |
10 | 1023040320122 |
11 | 364961654477 |
12 | 146332172362 |
13 | 7561a804162 |
14 | 3773042d002 |
15 | 1b92938cc32 |
hex | ee31f4727a |
1023040320122 has 8 divisors (see below), whose sum is σ = 1587476358900. Its totient is φ = 493881533824.
The previous prime is 1023040320121. The next prime is 1023040320139. The reversal of 1023040320122 is 2210230403201.
It can be written as a sum of positive squares in 2 ways, for example, as 979246805761 + 43793514361 = 989569^2 + 209269^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10230403201222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023040320094 and 1023040320103.
It is not an unprimeable number, because it can be changed into a prime (1023040320121) by changing a digit.
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, 8819313047 + ... + 8819313162.
Almost surely, 21023040320122 is an apocalyptic number.
1023040320122 is a deficient number, since it is larger than the sum of its proper divisors (564436038778).
1023040320122 is a wasteful number, since it uses less digits than its factorization.
1023040320122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17638626240.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1023040320122 its reverse (2210230403201), we get a palindrome (3233270723323).
The spelling of 1023040320122 in words is "one trillion, twenty-three billion, forty million, three hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •