Base | Representation |
---|---|
bin | 101000010011000100101111… |
… | …0110111100100011101100101 |
3 | 1201111001112202012202121002222 |
4 | 1100212021132313210131211 |
5 | 332430024304044030303 |
6 | 3253515030122242125 |
7 | 134443161102603446 |
oct | 12046113667443545 |
9 | 1644045665677088 |
10 | 354465242564453 |
11 | a2a419575a0929 |
12 | 339098a4656345 |
13 | 122a2c0cb88777 |
14 | 63762d03992cd |
15 | 2aea6c3992938 |
hex | 142625ede4765 |
354465242564453 has 4 divisors (see below), whose sum is σ = 369876774849888. Its totient is φ = 339053710279020.
The previous prime is 354465242564449. The next prime is 354465242564467.
354465242564453 is nontrivially palindromic in base 10.
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.
It is a cyclic number.
It is not a de Polignac number, because 354465242564453 - 22 = 354465242564449 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (354465242554453) 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, 7705766142683 + ... + 7705766142728.
It is an arithmetic number, because the mean of its divisors is an integer number (92469193712472).
Almost surely, 2354465242564453 is an apocalyptic number.
It is an amenable number.
354465242564453 is a deficient number, since it is larger than the sum of its proper divisors (15411532285435).
354465242564453 is a wasteful number, since it uses less digits than its factorization.
354465242564453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15411532285434.
The product of its digits is 829440000, while the sum is 62.
The spelling of 354465242564453 in words is "three hundred fifty-four trillion, four hundred sixty-five billion, two hundred forty-two million, five hundred sixty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •