Search a number
-
+
15485223 = 313397057
BaseRepresentation
bin111011000100…
…100100100111
31002010201201210
4323010210213
512431011343
61311522503
7245423265
oct73044447
932121653
1015485223
118817306
125229433
133292470
1420b1435
15155d333
hexec4927

15485223 has 8 divisors (see below), whose sum is σ = 22235248. Its totient is φ = 9529344.

The previous prime is 15485221. The next prime is 15485243. The reversal of 15485223 is 32258451.

15485223 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 15485223 - 21 = 15485221 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 (15485221) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198490 + ... + 198567.

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

Almost surely, 215485223 is an apocalyptic number.

15485223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

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

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

15485223 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 397073.

The product of its digits is 9600, while the sum is 30.

The square root of 15485223 is about 3935.1268086302. The cubic root of 15485223 is about 249.2522886068.

The spelling of 15485223 in words is "fifteen million, four hundred eighty-five thousand, two hundred twenty-three".

Divisors: 1 3 13 39 397057 1191171 5161741 15485223