Base | Representation |
---|---|
bin | 11101111110111101001… |
… | …00001110101011100011 |
3 | 10122111012120210200012101 |
4 | 32333132210032223203 |
5 | 113334403143114021 |
6 | 2105140502311231 |
7 | 134301042623314 |
oct | 16773644165343 |
9 | 3574176720171 |
10 | 1030231223011 |
11 | 367a11738221 |
12 | 1477ba428517 |
13 | 761c552a793 |
14 | 37c1348060b |
15 | 1bbea815a91 |
hex | efde90eae3 |
1030231223011 has 4 divisors (see below), whose sum is σ = 1038095583624. Its totient is φ = 1022366862400.
The previous prime is 1030231222927. The next prime is 1030231223051. The reversal of 1030231223011 is 1103221320301.
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 1030231223011 - 27 = 1030231222883 is a prime.
It is a super-2 number, since 2×10302312230112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1030231223011.
It is not an unprimeable number, because it can be changed into a prime (1030231223051) 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, 3932180110 + ... + 3932180371.
It is an arithmetic number, because the mean of its divisors is an integer number (259523895906).
Almost surely, 21030231223011 is an apocalyptic number.
1030231223011 is a deficient number, since it is larger than the sum of its proper divisors (7864360613).
1030231223011 is an equidigital number, since it uses as much as digits as its factorization.
1030231223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7864360612.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1030231223011 its reverse (1103221320301), we get a palindrome (2133452543312).
The spelling of 1030231223011 in words is "one trillion, thirty billion, two hundred thirty-one million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •