Search a number
-
+
3469093599701 is a prime number
BaseRepresentation
bin110010011110110110000…
…101110111100111010101
3110021122100002122011212002
4302132312011313213111
5423314200430142301
611213402443205045
7505430242031222
oct62366605674725
913248302564762
103469093599701
111118263997194
12480400516785
131c219888ac42
14bdc9556a949
156038bdaa16b
hex327b61779d5

3469093599701 has 2 divisors, whose sum is σ = 3469093599702. Its totient is φ = 3469093599700.

The previous prime is 3469093599691. The next prime is 3469093599733. The reversal of 3469093599701 is 1079953909643.

It is a happy number.

3469093599701 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3465051946225 + 4041653476 = 1861465^2 + 63574^2 .

It is a cyclic number.

It is not a de Polignac number, because 3469093599701 - 230 = 3468019857877 is a prime.

It is a super-2 number, since 2×34690935997012 (a number of 26 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (3469093593701) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1734546799850 + 1734546799851.

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

Almost surely, 23469093599701 is an apocalyptic number.

It is an amenable number.

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

3469093599701 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 49601160, while the sum is 65.

The spelling of 3469093599701 in words is "three trillion, four hundred sixty-nine billion, ninety-three million, five hundred ninety-nine thousand, seven hundred one".