Base | Representation |
---|---|
bin | 11101110001101011001… |
… | …01110001010101110011 |
3 | 10121210210200121120201002 |
4 | 32320311211301111303 |
5 | 113230302413412243 |
6 | 2102001203432215 |
7 | 133626255436001 |
oct | 16706545612563 |
9 | 3553720546632 |
10 | 1023101310323 |
11 | 3649930212a4 |
12 | 14634a68566b |
13 | 7562a339a31 |
14 | 37738587a71 |
15 | 1b92e8d8eb8 |
hex | ee35971573 |
1023101310323 has 8 divisors (see below), whose sum is σ = 1093407889392. Its totient is φ = 953919636736.
The previous prime is 1023101310311. The next prime is 1023101310331. The reversal of 1023101310323 is 3230131013201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023101310323 - 24 = 1023101310307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1023101310295 and 1023101310304.
It is not an unprimeable number, because it can be changed into a prime (1023101313323) 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 7 ways as a sum of consecutive naturals, for example, 281224490 + ... + 281228127.
It is an arithmetic number, because the mean of its divisors is an integer number (136675986174).
Almost surely, 21023101310323 is an apocalyptic number.
1023101310323 is a deficient number, since it is larger than the sum of its proper divisors (70306579069).
1023101310323 is a wasteful number, since it uses less digits than its factorization.
1023101310323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562452741.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1023101310323 its reverse (3230131013201), we get a palindrome (4253232323524).
The spelling of 1023101310323 in words is "one trillion, twenty-three billion, one hundred one million, three hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •