Base | Representation |
---|---|
bin | 11101110001100100000… |
… | …00111000111011010111 |
3 | 10121210122111201021022120 |
4 | 32320302000320323113 |
5 | 113230142033413143 |
6 | 2101551221431023 |
7 | 133624626442116 |
oct | 16706200707327 |
9 | 3553574637276 |
10 | 1023041310423 |
11 | 364962170500 |
12 | 14633256b473 |
13 | 7561aa8cb32 |
14 | 37730609c7d |
15 | 1b9294d6383 |
hex | ee32038ed7 |
1023041310423 has 12 divisors (see below), whose sum is σ = 1499333270904. Its totient is φ = 620025036400.
The previous prime is 1023041310419. The next prime is 1023041310449. The reversal of 1023041310423 is 3240131403201.
It is a happy number.
It is not a de Polignac number, because 1023041310423 - 22 = 1023041310419 is a prime.
It is a super-2 number, since 2×10230413104232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023041310393 and 1023041310402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023041310493) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1409147448 + ... + 1409148173.
It is an arithmetic number, because the mean of its divisors is an integer number (124944439242).
Almost surely, 21023041310423 is an apocalyptic number.
1023041310423 is a deficient number, since it is larger than the sum of its proper divisors (476291960481).
1023041310423 is a wasteful number, since it uses less digits than its factorization.
1023041310423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2818295646 (or 2818295635 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1023041310423 its reverse (3240131403201), we get a palindrome (4263172713624).
The spelling of 1023041310423 in words is "one trillion, twenty-three billion, forty-one million, three hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •