Base | Representation |
---|---|
bin | 1110011011101… |
… | …01111101110111 |
3 | 22102210222001000 |
4 | 13031311331313 |
5 | 221443210211 |
6 | 20002534343 |
7 | 3000034050 |
oct | 715657567 |
9 | 272728030 |
10 | 121069431 |
11 | 6238228a |
12 | 346673b3 |
13 | 1c10c922 |
14 | 12117727 |
15 | a967656 |
hex | 7375f77 |
121069431 has 16 divisors (see below), whose sum is σ = 204985600. Its totient is φ = 69182424.
The previous prime is 121069409. The next prime is 121069453. The reversal of 121069431 is 134960121.
It is an interprime number because it is at equal distance from previous prime (121069409) and next prime (121069453).
It is not a de Polignac number, because 121069431 - 27 = 121069303 is a prime.
It is a super-2 number, since 2×1210694312 = 29315614245327522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121069395 and 121069404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121069471) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320101 + ... + 320478.
It is an arithmetic number, because the mean of its divisors is an integer number (12811600).
Almost surely, 2121069431 is an apocalyptic number.
121069431 is a deficient number, since it is larger than the sum of its proper divisors (83916169).
121069431 is an equidigital number, since it uses as much as digits as its factorization.
121069431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 640595 (or 640589 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 121069431 is about 11003.1555019458. The cubic root of 121069431 is about 494.7033300367.
The spelling of 121069431 in words is "one hundred twenty-one million, sixty-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.334 sec. • engine limits •