Base | Representation |
---|---|
bin | 101111010010111011100… |
… | …010011101110111100001 |
3 | 102111201011221220201101112 |
4 | 233102323202131313201 |
5 | 411222242230303101 |
6 | 10525032223113105 |
7 | 453546353126552 |
oct | 57227342356741 |
9 | 12451157821345 |
10 | 3250141650401 |
11 | 1043417259a78 |
12 | 445a95a42795 |
13 | 1a76440563a9 |
14 | b344445c329 |
15 | 59824bdd6bb |
hex | 2f4bb89dde1 |
3250141650401 has 4 divisors (see below), whose sum is σ = 3282321270804. Its totient is φ = 3217962030000.
The previous prime is 3250141650361. The next prime is 3250141650449. The reversal of 3250141650401 is 1040561410523.
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 1378567167376 + 1871574483025 = 1174124^2 + 1368055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3250141650401 is a prime.
It is a super-2 number, since 2×32501416504012 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3250141650461) 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, 16089810050 + ... + 16089810251.
It is an arithmetic number, because the mean of its divisors is an integer number (820580317701).
Almost surely, 23250141650401 is an apocalyptic number.
It is an amenable number.
3250141650401 is a deficient number, since it is larger than the sum of its proper divisors (32179620403).
3250141650401 is a wasteful number, since it uses less digits than its factorization.
3250141650401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32179620402.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 3250141650401 in words is "three trillion, two hundred fifty billion, one hundred forty-one million, six hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •