Base | Representation |
---|---|
bin | 11101111110110000010… |
… | …00100100101110111101 |
3 | 10122110221001202010101200 |
4 | 32333120020210232331 |
5 | 113334143031410023 |
6 | 2105122045330113 |
7 | 134265262443210 |
oct | 16773010445675 |
9 | 3573831663350 |
10 | 1030123310013 |
11 | 367966831626 |
12 | 14778a266939 |
13 | 761a9076335 |
14 | 37c02dcd777 |
15 | 1bbe10eb743 |
hex | efd8224bbd |
1030123310013 has 24 divisors (see below), whose sum is σ = 1700601933888. Its totient is φ = 588613882752.
The previous prime is 1030123310009. The next prime is 1030123310039. The reversal of 1030123310013 is 3100133210301.
It is a happy number.
It is not a de Polignac number, because 1030123310013 - 22 = 1030123310009 is a prime.
It is a super-2 number, since 2×10301233100132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030123320013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 983670 + ... + 1740072.
It is an arithmetic number, because the mean of its divisors is an integer number (70858413912).
Almost surely, 21030123310013 is an apocalyptic number.
It is an amenable number.
1030123310013 is a deficient number, since it is larger than the sum of its proper divisors (670478623875).
1030123310013 is a wasteful number, since it uses less digits than its factorization.
1030123310013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778033 (or 778030 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1030123310013 its reverse (3100133210301), we get a palindrome (4130256520314).
The spelling of 1030123310013 in words is "one trillion, thirty billion, one hundred twenty-three million, three hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •