Base | Representation |
---|---|
bin | 110010010001001100011… |
… | …010000011011110001101 |
3 | 110020020111120000212100221 |
4 | 302101030122003132031 |
5 | 423044141003314430 |
6 | 11202540143351341 |
7 | 504401064106024 |
oct | 62211432033615 |
9 | 13206446025327 |
10 | 3454435604365 |
11 | 1112021929359 |
12 | 4795ab5b2551 |
13 | 1c09a0b58b15 |
14 | bd2a49318bb |
15 | 5ecd010057a |
hex | 3244c68378d |
3454435604365 has 4 divisors (see below), whose sum is σ = 4145322725244. Its totient is φ = 2763548483488.
The previous prime is 3454435604311. The next prime is 3454435604461. The reversal of 3454435604365 is 5634065344543.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1468221736804 + 1986213867561 = 1211702^2 + 1409331^2 .
It is a cyclic number.
It is not a de Polignac number, because 3454435604365 - 213 = 3454435596173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 345443560432 + ... + 345443560441.
It is an arithmetic number, because the mean of its divisors is an integer number (1036330681311).
Almost surely, 23454435604365 is an apocalyptic number.
It is an amenable number.
3454435604365 is a deficient number, since it is larger than the sum of its proper divisors (690887120879).
3454435604365 is an equidigital number, since it uses as much as digits as its factorization.
3454435604365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690887120878.
The product of its (nonzero) digits is 31104000, while the sum is 52.
The spelling of 3454435604365 in words is "three trillion, four hundred fifty-four billion, four hundred thirty-five million, six hundred four thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •