Base | Representation |
---|---|
bin | 110001101010010001000… |
… | …111100111111111011001 |
3 | 110002020121122211120002122 |
4 | 301222101013213333121 |
5 | 421403041003300103 |
6 | 11131424455311025 |
7 | 501361240401044 |
oct | 61522107477731 |
9 | 13066548746078 |
10 | 3412638728153 |
11 | 10a632365a656 |
12 | 47148597b475 |
13 | 1b9a6c73b2c5 |
14 | bb25b861c5b |
15 | 5db859cab38 |
hex | 31a911e7fd9 |
3412638728153 has 8 divisors (see below), whose sum is σ = 3523249764096. Its totient is φ = 3302060562000.
The previous prime is 3412638728119. The next prime is 3412638728173. The reversal of 3412638728153 is 3518278362143.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3412638728153 - 236 = 3343919251417 is a prime.
It is a super-2 number, since 2×34126387281532 (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 = 3412638728095 and 3412638728104.
It is not an unprimeable number, because it can be changed into a prime (3412638728173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8006351 + ... + 8421812.
It is an arithmetic number, because the mean of its divisors is an integer number (440406220512).
Almost surely, 23412638728153 is an apocalyptic number.
It is an amenable number.
3412638728153 is a deficient number, since it is larger than the sum of its proper divisors (110611035943).
3412638728153 is a wasteful number, since it uses less digits than its factorization.
3412638728153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16434895.
The product of its digits is 5806080, while the sum is 53.
The spelling of 3412638728153 in words is "three trillion, four hundred twelve billion, six hundred thirty-eight million, seven hundred twenty-eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •