Base | Representation |
---|---|
bin | 1001110010100111100… |
… | …00100111000101100011 |
3 | 1012011100011211220011200 |
4 | 10321103300213011203 |
5 | 21002433122413102 |
6 | 414313523412243 |
7 | 33206422530504 |
oct | 4712360470543 |
9 | 1164304756150 |
10 | 336412701027 |
11 | 11a743221547 |
12 | 55247b24083 |
13 | 2595392a150 |
14 | 123d5108bab |
15 | 8b3e29251c |
hex | 4e53c27163 |
336412701027 has 48 divisors (see below), whose sum is σ = 550944576000. Its totient is φ = 196094001600.
The previous prime is 336412701019. The next prime is 336412701029. The reversal of 336412701027 is 720107214633.
336412701027 is a `hidden beast` number, since 3 + 3 + 641 + 2 + 7 + 0 + 1 + 0 + 2 + 7 = 666.
It is not a de Polignac number, because 336412701027 - 23 = 336412701019 is a prime.
It is a super-2 number, since 2×3364127010272 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 336412700982 and 336412701000.
It is not an unprimeable number, because it can be changed into a prime (336412701029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20441152 + ... + 20457602.
It is an arithmetic number, because the mean of its divisors is an integer number (11478012000).
Almost surely, 2336412701027 is an apocalyptic number.
336412701027 is a deficient number, since it is larger than the sum of its proper divisors (214531874973).
336412701027 is a wasteful number, since it uses less digits than its factorization.
336412701027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25688 (or 25685 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 36.
The spelling of 336412701027 in words is "three hundred thirty-six billion, four hundred twelve million, seven hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •