Search a number
-
+
13950270 = 2325155003
BaseRepresentation
bin110101001101…
…110100111110
3222020202011200
4311031310332
512032402040
61215000330
7226401225
oct65156476
928222150
1013950270
117969054
1248090a6
132b758c9
141bd1cbc
151358630
hexd4dd3e

13950270 has 24 divisors (see below), whose sum is σ = 36270936. Its totient is φ = 3720048.

The previous prime is 13950269. The next prime is 13950281. The reversal of 13950270 is 7205931.

13950270 is a `hidden beast` number, since 1 + 395 + 0 + 270 = 666.

It is a super-2 number, since 2×139502702 = 389220066145800, which contains 22 as substring.

It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 77412 + ... + 77591.

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

Almost surely, 213950270 is an apocalyptic number.

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

13950270 is an abundant number, since it is smaller than the sum of its proper divisors (22320666).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 155016 (or 155013 counting only the distinct ones).

The product of its (nonzero) digits is 1890, while the sum is 27.

The square root of 13950270 is about 3735.0060240915. The cubic root of 13950270 is about 240.7285155338.

The spelling of 13950270 in words is "thirteen million, nine hundred fifty thousand, two hundred seventy".

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 155003 310006 465009 775015 930018 1395027 1550030 2325045 2790054 4650090 6975135 13950270