Base | Representation |
---|---|
bin | 11101111110101110101… |
… | …11011100100001011011 |
3 | 10122110220011111211011011 |
4 | 32333113113130201123 |
5 | 113334131232300243 |
6 | 2105120505314351 |
7 | 134265045124051 |
oct | 16772727344133 |
9 | 3573804454134 |
10 | 1030110431323 |
11 | 36795a535686 |
12 | 147785a959b7 |
13 | 761a64b73cc |
14 | 37c013da1d1 |
15 | 1bbdee0589d |
hex | efd75dc85b |
1030110431323 has 4 divisors (see below), whose sum is σ = 1030493802240. Its totient is φ = 1029727060408.
The previous prime is 1030110431321. The next prime is 1030110431333. The reversal of 1030110431323 is 3231340110301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1030110431323 - 21 = 1030110431321 is a prime.
It is a super-2 number, since 2×10301104313232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030110431294 and 1030110431303.
It is not an unprimeable number, because it can be changed into a prime (1030110431321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191681428 + ... + 191686801.
It is an arithmetic number, because the mean of its divisors is an integer number (257623450560).
Almost surely, 21030110431323 is an apocalyptic number.
1030110431323 is a deficient number, since it is larger than the sum of its proper divisors (383370917).
1030110431323 is an equidigital number, since it uses as much as digits as its factorization.
1030110431323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 383370916.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1030110431323 its reverse (3231340110301), we get a palindrome (4261450541624).
The spelling of 1030110431323 in words is "one trillion, thirty billion, one hundred ten million, four hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •