Base | Representation |
---|---|
bin | 111110110011111110010100… |
… | …1111011011101101111110111 |
3 | 2200110020120122202012010011012 |
4 | 1331213330221323131233313 |
5 | 1034404134022332204333 |
6 | 5235023242303502435 |
7 | 224242610604201320 |
oct | 17547745173355767 |
9 | 2613216582163135 |
10 | 552501001444343 |
11 | 1500533a470a096 |
12 | 51b7248b5b7a1b |
13 | 1a93980c0c04c3 |
14 | 9a6129673d447 |
15 | 43d1c44037e48 |
hex | 1f67f29eddbf7 |
552501001444343 has 16 divisors (see below), whose sum is σ = 632068507745280. Its totient is φ = 473093434670976.
The previous prime is 552501001444331. The next prime is 552501001444351. The reversal of 552501001444343 is 343444100105255.
It is not a de Polignac number, because 552501001444343 - 212 = 552501001440247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 552501001444343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552501001444363) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17386655 + ... + 37513967.
It is an arithmetic number, because the mean of its divisors is an integer number (39504281734080).
Almost surely, 2552501001444343 is an apocalyptic number.
552501001444343 is a deficient number, since it is larger than the sum of its proper divisors (79567506300937).
552501001444343 is a wasteful number, since it uses less digits than its factorization.
552501001444343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20131286.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 552501001444343 its reverse (343444100105255), we get a palindrome (895945101549598).
The spelling of 552501001444343 in words is "five hundred fifty-two trillion, five hundred one billion, one million, four hundred forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •