Base | Representation |
---|---|
bin | 101001101010000… |
… | …1111010011000101 |
3 | 10121102020022222021 |
4 | 1103110033103011 |
5 | 10330320030334 |
6 | 350412003141 |
7 | 46432140562 |
oct | 12324172305 |
9 | 3542208867 |
10 | 1397814469 |
11 | 658036777 |
12 | 3301604b1 |
13 | 193794a6c |
14 | d3903869 |
15 | 82ab23b4 |
hex | 5350f4c5 |
1397814469 has 4 divisors (see below), whose sum is σ = 1397931840. Its totient is φ = 1397697100.
The previous prime is 1397814463. The next prime is 1397814479. The reversal of 1397814469 is 9644187931.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9644187931 = 7 ⋅1377741133.
It is a cyclic number.
It is not a de Polignac number, because 1397814469 - 23 = 1397814461 is a prime.
It is a super-2 number, since 2×13978144692 = 3907770579491503922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1397814461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38509 + ... + 65410.
It is an arithmetic number, because the mean of its divisors is an integer number (349482960).
Almost surely, 21397814469 is an apocalyptic number.
It is an amenable number.
1397814469 is a deficient number, since it is larger than the sum of its proper divisors (117371).
1397814469 is a wasteful number, since it uses less digits than its factorization.
1397814469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117370.
The product of its digits is 1306368, while the sum is 52.
The square root of 1397814469 is about 37387.3570742838. The cubic root of 1397814469 is about 1118.1065128620.
The spelling of 1397814469 in words is "one billion, three hundred ninety-seven million, eight hundred fourteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •