Base | Representation |
---|---|
bin | 1001101110110100001… |
… | …11100110000111010001 |
3 | 1011222001221201202200201 |
4 | 10313122013212013101 |
5 | 20434243201443001 |
6 | 413335222215201 |
7 | 33105022210000 |
oct | 4673207460721 |
9 | 1158057652621 |
10 | 334371906001 |
11 | 119896250a91 |
12 | 54978584501 |
13 | 256b9b9b423 |
14 | 12280070c37 |
15 | 8a70022501 |
hex | 4dda1e61d1 |
334371906001 has 15 divisors (see below), whose sum is σ = 390110403803. Its totient is φ = 286580204400.
The previous prime is 334371905983. The next prime is 334371906013. The reversal of 334371906001 is 100609173433.
The square root of 334371906001 is 578249.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 177619259601 + 156752646400 = 421449^2 + 395920^2 .
It is not a de Polignac number, because 334371906001 - 25 = 334371905969 is a prime.
It is a super-2 number, since 2×3343719060012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (334371906601) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 28328301 + ... + 28340101.
Almost surely, 2334371906001 is an apocalyptic number.
334371906001 is the 578249-th square number.
334371906001 is the 289125-th centered octagonal number.
It is an amenable number.
334371906001 is a deficient number, since it is larger than the sum of its proper divisors (55738497802).
334371906001 is an frugal number, since it uses more digits than its factorization.
334371906001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23630 (or 11808 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 37.
The spelling of 334371906001 in words is "three hundred thirty-four billion, three hundred seventy-one million, nine hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •