Base | Representation |
---|---|
bin | 11101111111000101100… |
… | …11000110101010111111 |
3 | 10122111101112102021011110 |
4 | 32333202303012222333 |
5 | 113340024332344411 |
6 | 2105151520253103 |
7 | 134302564316340 |
oct | 16774263065277 |
9 | 3574345367143 |
10 | 1030302231231 |
11 | 367a488277a9 |
12 | 14781a171193 |
13 | 76207160190 |
14 | 37c1ca860c7 |
15 | 1bc01b902a6 |
hex | efe2cc6abf |
1030302231231 has 16 divisors (see below), whose sum is σ = 1690752379904. Its totient is φ = 543456121824.
The previous prime is 1030302231229. The next prime is 1030302231241. The reversal of 1030302231231 is 1321322030301.
It is not a de Polignac number, because 1030302231231 - 21 = 1030302231229 is a prime.
It is a super-2 number, since 2×10303022312312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1030302231198 and 1030302231207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030302231221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1887000151 + ... + 1887000696.
It is an arithmetic number, because the mean of its divisors is an integer number (105672023744).
Almost surely, 21030302231231 is an apocalyptic number.
1030302231231 is a deficient number, since it is larger than the sum of its proper divisors (660450148673).
1030302231231 is a wasteful number, since it uses less digits than its factorization.
1030302231231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3774000870.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1030302231231 its reverse (1321322030301), we get a palindrome (2351624261532).
The spelling of 1030302231231 in words is "one trillion, thirty billion, three hundred two million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •