Base | Representation |
---|---|
bin | 110001100010010000000… |
… | …000010101011011110011 |
3 | 110001102101201012012122100 |
4 | 301202100000111123303 |
5 | 421232423201332311 |
6 | 11123442334511443 |
7 | 500635016326242 |
oct | 61422000253363 |
9 | 13042351165570 |
10 | 3404030105331 |
11 | 10a2706284939 |
12 | 46b882965583 |
13 | 1b8cca0a084b |
14 | baa82408959 |
15 | 5d82ed5ca56 |
hex | 318900156f3 |
3404030105331 has 6 divisors (see below), whose sum is σ = 4916932374380. Its totient is φ = 2269353403548.
The previous prime is 3404030105327. The next prime is 3404030105353. The reversal of 3404030105331 is 1335010304043.
It is not a de Polignac number, because 3404030105331 - 22 = 3404030105327 is a prime.
It is a super-2 number, since 2×34040301053312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3404030105295 and 3404030105304.
It is not an unprimeable number, because it can be changed into a prime (3404030104331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 189112783621 + ... + 189112783638.
Almost surely, 23404030105331 is an apocalyptic number.
3404030105331 is a deficient number, since it is larger than the sum of its proper divisors (1512902269049).
3404030105331 is a wasteful number, since it uses less digits than its factorization.
3404030105331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378225567265 (or 378225567262 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 3404030105331 its reverse (1335010304043), we get a palindrome (4739040409374).
The spelling of 3404030105331 in words is "three trillion, four hundred four billion, thirty million, one hundred five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •