Base | Representation |
---|---|
bin | 110000000100000001… |
… | …0010111111111101001 |
3 | 100212102011110021101122 |
4 | 1200020002113333221 |
5 | 3142340244233101 |
6 | 115225455225025 |
7 | 10312511665262 |
oct | 1401002277751 |
9 | 325364407348 |
10 | 103214055401 |
11 | 3a855709536 |
12 | 18006218175 |
13 | 996b65c982 |
14 | 4dd1c67969 |
15 | 2a414b251b |
hex | 1808097fe9 |
103214055401 has 4 divisors (see below), whose sum is σ = 103810668612. Its totient is φ = 102617442192.
The previous prime is 103214055389. The next prime is 103214055403. The reversal of 103214055401 is 104550412301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36337509376 + 66876546025 = 190624^2 + 258605^2 .
It is a cyclic number.
It is not a de Polignac number, because 103214055401 - 218 = 103213793257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103214055403) 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 3 ways as a sum of consecutive naturals, for example, 298306346 + ... + 298306691.
It is an arithmetic number, because the mean of its divisors is an integer number (25952667153).
Almost surely, 2103214055401 is an apocalyptic number.
It is an amenable number.
103214055401 is a deficient number, since it is larger than the sum of its proper divisors (596613211).
103214055401 is an equidigital number, since it uses as much as digits as its factorization.
103214055401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596613210.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 103214055401 its reverse (104550412301), we get a palindrome (207764467702).
The spelling of 103214055401 in words is "one hundred three billion, two hundred fourteen million, fifty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •