Base | Representation |
---|---|
bin | 101110101000001011… |
… | …0011111100000010111 |
3 | 100120110101121221221201 |
4 | 1131100112133200113 |
5 | 3120032333240203 |
6 | 114000011053331 |
7 | 10143241454620 |
oct | 1352026374027 |
9 | 316411557851 |
10 | 100132321303 |
11 | 395140a3053 |
12 | 174a6141247 |
13 | 959a05b981 |
14 | 4bbc866a47 |
15 | 2910b75e1d |
hex | 175059f817 |
100132321303 has 4 divisors (see below), whose sum is σ = 114436938640. Its totient is φ = 85827703968.
The previous prime is 100132321283. The next prime is 100132321307. The reversal of 100132321303 is 303123231001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303123231001 = 482941 ⋅627661.
It is a cyclic number.
It is not a de Polignac number, because 100132321303 - 229 = 99595450391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100132321307) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 7152308658 + ... + 7152308671.
It is an arithmetic number, because the mean of its divisors is an integer number (28609234660).
Almost surely, 2100132321303 is an apocalyptic number.
100132321303 is a deficient number, since it is larger than the sum of its proper divisors (14304617337).
100132321303 is an equidigital number, since it uses as much as digits as its factorization.
100132321303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14304617336.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 100132321303 its reverse (303123231001), we get a palindrome (403255552304).
The spelling of 100132321303 in words is "one hundred billion, one hundred thirty-two million, three hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •