Base | Representation |
---|---|
bin | 10110110011111111110011… |
… | …001011101101100100101011 |
3 | 111011020110211121101110210021 |
4 | 112303333303023231210223 |
5 | 101122302243034013003 |
6 | 553215022304501311 |
7 | 30063422256266350 |
oct | 2663776313554453 |
9 | 434213747343707 |
10 | 100330221001003 |
11 | 29a71898173864 |
12 | b30480401a837 |
13 | 43ca13a067b66 |
14 | 1aac01988a627 |
15 | b8ec451ae2bd |
hex | 5b3ff32ed92b |
100330221001003 has 4 divisors (see below), whose sum is σ = 114663109715440. Its totient is φ = 85997332286568.
The previous prime is 100330221000979. The next prime is 100330221001007. The reversal of 100330221001003 is 300100122033001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100330221001003 - 225 = 100330187446571 is a prime.
It is a super-2 number, since 2×1003302210010032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100330221001007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7166444357208 + ... + 7166444357221.
It is an arithmetic number, because the mean of its divisors is an integer number (28665777428860).
Almost surely, 2100330221001003 is an apocalyptic number.
100330221001003 is a deficient number, since it is larger than the sum of its proper divisors (14332888714437).
100330221001003 is an equidigital number, since it uses as much as digits as its factorization.
100330221001003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14332888714436.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100330221001003 its reverse (300100122033001), we get a palindrome (400430343034004).
The spelling of 100330221001003 in words is "one hundred trillion, three hundred thirty billion, two hundred twenty-one million, one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •