Base | Representation |
---|---|
bin | 101111100010111010… |
… | …0100000010000111001 |
3 | 100202112202001001122012 |
4 | 1133011310200100321 |
5 | 3133101344414001 |
6 | 114523332135305 |
7 | 10243132140305 |
oct | 1370564402071 |
9 | 322482031565 |
10 | 102103123001 |
11 | 3a335607590 |
12 | 17956167535 |
13 | 9822451c19 |
14 | 4d284c0d05 |
15 | 29c8bbc2bb |
hex | 17c5d20439 |
102103123001 has 8 divisors (see below), whose sum is σ = 117247605600. Its totient is φ = 87935703840.
The previous prime is 102103122983. The next prime is 102103123009. The reversal of 102103123001 is 100321301201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102103123001 - 210 = 102103121977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102103123009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244265636 + ... + 244266053.
It is an arithmetic number, because the mean of its divisors is an integer number (14655950700).
Almost surely, 2102103123001 is an apocalyptic number.
102103123001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102103123001 is a deficient number, since it is larger than the sum of its proper divisors (15144482599).
102103123001 is a wasteful number, since it uses less digits than its factorization.
102103123001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488531719.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 102103123001 its reverse (100321301201), we get a palindrome (202424424202).
The spelling of 102103123001 in words is "one hundred two billion, one hundred three million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •