Base | Representation |
---|---|
bin | 110010001101010110001… |
… | …110111100101111000011 |
3 | 110012211211201111201121102 |
4 | 302031112032330233003 |
5 | 423012211201414201 |
6 | 11201014245045015 |
7 | 504163533556526 |
oct | 62152616745703 |
9 | 13184751451542 |
10 | 3450305498051 |
11 | 11102a2560355 |
12 | 4788383b676b |
13 | 1c04932b2429 |
14 | bcdd21d0bbd |
15 | 5eb3c72a26b |
hex | 323563bcbc3 |
3450305498051 has 4 divisors (see below), whose sum is σ = 3450309470400. Its totient is φ = 3450301525704.
The previous prime is 3450305498041. The next prime is 3450305498071. The reversal of 3450305498051 is 1508945030543.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3450305498051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3450305497987 and 3450305498005.
It is not an unprimeable number, because it can be changed into a prime (3450305498041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61811 + ... + 2627628.
It is an arithmetic number, because the mean of its divisors is an integer number (862577367600).
Almost surely, 23450305498051 is an apocalyptic number.
3450305498051 is a deficient number, since it is larger than the sum of its proper divisors (3972349).
3450305498051 is a wasteful number, since it uses less digits than its factorization.
3450305498051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3972348.
The product of its (nonzero) digits is 1296000, while the sum is 47.
The spelling of 3450305498051 in words is "three trillion, four hundred fifty billion, three hundred five million, four hundred ninety-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •