Base | Representation |
---|---|
bin | 10001110010010111010… |
… | …110100111100101101011 |
3 | 11022211222212220120212220 |
4 | 101302113112213211223 |
5 | 130011242330013003 |
6 | 2333304345205123 |
7 | 154210660403520 |
oct | 21622726474553 |
9 | 4284885816786 |
10 | 1222310001003 |
11 | 431419148053 |
12 | 178a851907a3 |
13 | 8b356729930 |
14 | 43235523147 |
15 | 21bdd651353 |
hex | 11c975a796b |
1222310001003 has 16 divisors (see below), whose sum is σ = 2005842053376. Its totient is φ = 644734945440.
The previous prime is 1222310000993. The next prime is 1222310001043. The reversal of 1222310001003 is 3001000132221.
It is not a de Polignac number, because 1222310001003 - 222 = 1222305806699 is a prime.
It is a super-2 number, since 2×12223100010032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1222310001043) 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 15 ways as a sum of consecutive naturals, for example, 2238662733 + ... + 2238663278.
It is an arithmetic number, because the mean of its divisors is an integer number (125365128336).
Almost surely, 21222310001003 is an apocalyptic number.
1222310001003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1222310001003 is a deficient number, since it is larger than the sum of its proper divisors (783532052373).
1222310001003 is a wasteful number, since it uses less digits than its factorization.
1222310001003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4477326034.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1222310001003 its reverse (3001000132221), we get a palindrome (4223310133224).
The spelling of 1222310001003 in words is "one trillion, two hundred twenty-two billion, three hundred ten million, one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •