Search a number
-
+
103255213465 = 5371075216227
BaseRepresentation
bin110000000101001111…
…1011000010110011001
3100212112000220022122101
41200022133120112121
53142431313312330
6115233525323401
710313521555525
oct1401237302631
9325460808571
10103255213465
113a876970168
1218017b66561
139977040661
144dd74dcd85
152a44de24ca
hex180a7d8599

103255213465 has 16 divisors (see below), whose sum is σ = 128444398272. Its totient is φ = 79620473664.

The previous prime is 103255213441. The next prime is 103255213517. The reversal of 103255213465 is 564312552301.

It is a cyclic number.

It is not a de Polignac number, because 103255213465 - 25 = 103255213433 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (37).

It is a Duffinian number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 2588319 + ... + 2627908.

It is an arithmetic number, because the mean of its divisors is an integer number (8027774892).

Almost surely, 2103255213465 is an apocalyptic number.

It is an amenable number.

103255213465 is a deficient number, since it is larger than the sum of its proper divisors (25189184807).

103255213465 is a wasteful number, since it uses less digits than its factorization.

103255213465 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 5216376.

The product of its (nonzero) digits is 108000, while the sum is 37.

Adding to 103255213465 its reverse (564312552301), we get a palindrome (667567765766).

The spelling of 103255213465 in words is "one hundred three billion, two hundred fifty-five million, two hundred thirteen thousand, four hundred sixty-five".

Divisors: 1 5 37 107 185 535 3959 19795 5216227 26081135 193000399 558136289 965001995 2790681445 20651042693 103255213465