Base | Representation |
---|---|
bin | 11101011101100011110… |
… | …10000100001100100010 |
3 | 10120202221002000000200201 |
4 | 32232301322010030202 |
5 | 113041143314301310 |
6 | 2053013431135414 |
7 | 133064534622340 |
oct | 16566172041442 |
9 | 3522832000621 |
10 | 1012302103330 |
11 | 360351168241 |
12 | 144235b1456a |
13 | 745c8bb661b |
14 | 36dd2224990 |
15 | 1b4eb7ade3a |
hex | ebb1e84322 |
1012302103330 has 64 divisors (see below), whose sum is σ = 2200582805760. Its totient is φ = 327528382464.
The previous prime is 1012302103259. The next prime is 1012302103343. The reversal of 1012302103330 is 333012032101.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1012302103298 and 1012302103307.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1138987 + ... + 1822606.
It is an arithmetic number, because the mean of its divisors is an integer number (34384106340).
Almost surely, 21012302103330 is an apocalyptic number.
1012302103330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012302103330 is an abundant number, since it is smaller than the sum of its proper divisors (1188280702430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012302103330 is a wasteful number, since it uses less digits than its factorization.
1012302103330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2961883.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1012302103330 its reverse (333012032101), we get a palindrome (1345314135431).
The spelling of 1012302103330 in words is "one trillion, twelve billion, three hundred two million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •