Base | Representation |
---|---|
bin | 10100011011111000100… |
… | …111011101111100110101 |
3 | 11222020211012110122122112 |
4 | 110123320213131330311 |
5 | 141002032042344412 |
6 | 2553050202540405 |
7 | 203313421511054 |
oct | 24337047357465 |
9 | 4866735418575 |
10 | 1404330434357 |
11 | 4a1633a12764 |
12 | 1a8203507705 |
13 | a2573b20c76 |
14 | 4bd817b639b |
15 | 267e3406722 |
hex | 146f89ddf35 |
1404330434357 has 2 divisors, whose sum is σ = 1404330434358. Its totient is φ = 1404330434356.
The previous prime is 1404330434327. The next prime is 1404330434369. The reversal of 1404330434357 is 7534340334041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 744793164196 + 659537270161 = 863014^2 + 812119^2 .
It is a cyclic number.
It is not a de Polignac number, because 1404330434357 - 26 = 1404330434293 is a prime.
It is a super-2 number, since 2×14043304343572 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1404330434327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 702165217178 + 702165217179.
It is an arithmetic number, because the mean of its divisors is an integer number (702165217179).
Almost surely, 21404330434357 is an apocalyptic number.
It is an amenable number.
1404330434357 is a deficient number, since it is larger than the sum of its proper divisors (1).
1404330434357 is an equidigital number, since it uses as much as digits as its factorization.
1404330434357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 41.
Adding to 1404330434357 its reverse (7534340334041), we get a palindrome (8938670768398).
The spelling of 1404330434357 in words is "one trillion, four hundred four billion, three hundred thirty million, four hundred thirty-four thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •