Base | Representation |
---|---|
bin | 11101110001101110111… |
… | …00011111001010110111 |
3 | 10121210212212011200021220 |
4 | 32320313130133022313 |
5 | 113230333400243111 |
6 | 2102004234441423 |
7 | 133630114112634 |
oct | 16706734371267 |
9 | 3553785150256 |
10 | 1023132431031 |
11 | 3649a9647797 |
12 | 146358b93273 |
13 | 75633914b59 |
14 | 3773c76918b |
15 | 1b9324d4e06 |
hex | ee3771f2b7 |
1023132431031 has 8 divisors (see below), whose sum is σ = 1364181711360. Its totient is φ = 682085719032.
The previous prime is 1023132431011. The next prime is 1023132431093. The reversal of 1023132431031 is 1301342313201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023132431031 - 215 = 1023132398263 is a prime.
It is a super-2 number, since 2×10231324310312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023132430992 and 1023132431010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023132431011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 671130 + ... + 1580088.
It is an arithmetic number, because the mean of its divisors is an integer number (170522713920).
Almost surely, 21023132431031 is an apocalyptic number.
1023132431031 is a deficient number, since it is larger than the sum of its proper divisors (341049280329).
1023132431031 is an equidigital number, since it uses as much as digits as its factorization.
1023132431031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1284165.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1023132431031 its reverse (1301342313201), we get a palindrome (2324474744232).
The spelling of 1023132431031 in words is "one trillion, twenty-three billion, one hundred thirty-two million, four hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •