Base | Representation |
---|---|
bin | 11101111110101101111… |
… | …00010010001111010000 |
3 | 10122110212200010002100001 |
4 | 32333112330102033100 |
5 | 113334122421430222 |
6 | 2105120052535344 |
7 | 134264630451025 |
oct | 16772674221720 |
9 | 3573780102301 |
10 | 1030103311312 |
11 | 367956512279 |
12 | 147783621554 |
13 | 761a4b9369a |
14 | 37c004a554c |
15 | 1bbde49ae27 |
hex | efd6f123d0 |
1030103311312 has 20 divisors (see below), whose sum is σ = 1996023496320. Its totient is φ = 515000473568.
The previous prime is 1030103311261. The next prime is 1030103311313. The reversal of 1030103311312 is 2131133010301.
It is a super-2 number, since 2×10301033113122 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030103311312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030103311313) 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 3 ways as a sum of consecutive naturals, for example, 3032578 + ... + 3355105.
It is an arithmetic number, because the mean of its divisors is an integer number (99801174816).
Almost surely, 21030103311312 is an apocalyptic number.
It is an amenable number.
1030103311312 is a deficient number, since it is larger than the sum of its proper divisors (965920185008).
1030103311312 is a wasteful number, since it uses less digits than its factorization.
1030103311312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6397770 (or 6397764 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1030103311312 its reverse (2131133010301), we get a palindrome (3161236321613).
The spelling of 1030103311312 in words is "one trillion, thirty billion, one hundred three million, three hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •