Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …00110001111101110111 |
3 | 10120202200000221200121000 |
4 | 32232223320301331313 |
5 | 113040441440300343 |
6 | 2052555422254343 |
7 | 133062200263362 |
oct | 16565370617567 |
9 | 3522600850530 |
10 | 1012201103223 |
11 | 3602aa153382 |
12 | 1442081273b3 |
13 | 745b0cb284b |
14 | 36dc2a530d9 |
15 | 1b4e29aced3 |
hex | ebabe31f77 |
1012201103223 has 8 divisors (see below), whose sum is σ = 1499557190000. Its totient is φ = 674800735464.
The previous prime is 1012201103213. The next prime is 1012201103279. The reversal of 1012201103223 is 3223011022101.
1012201103223 is a `hidden beast` number, since 10 + 1 + 220 + 110 + 322 + 3 = 666.
It is not a de Polignac number, because 1012201103223 - 212 = 1012201099127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012201103196 and 1012201103205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012201103203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18744464848 + ... + 18744464901.
It is an arithmetic number, because the mean of its divisors is an integer number (187444648750).
Almost surely, 21012201103223 is an apocalyptic number.
1012201103223 is a deficient number, since it is larger than the sum of its proper divisors (487356086777).
1012201103223 is an equidigital number, since it uses as much as digits as its factorization.
1012201103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37488929758 (or 37488929752 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1012201103223 its reverse (3223011022101), we get a palindrome (4235212125324).
The spelling of 1012201103223 in words is "one trillion, twelve billion, two hundred one million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •