Base | Representation |
---|---|
bin | 10100111110010001001110… |
… | …00011011000001011110101 |
3 | 20001022000211002000112101222 |
4 | 22133020213003120023311 |
5 | 22021112242042140430 |
6 | 242031124132200125 |
7 | 12500026640646014 |
oct | 1237104703301365 |
9 | 201260732015358 |
10 | 46120014021365 |
11 | 1377142a629049 |
12 | 520a44b469045 |
13 | 1c971389b098b |
14 | b56313420a7b |
15 | 54ea49ec99e5 |
hex | 29f2270d82f5 |
46120014021365 has 16 divisors (see below), whose sum is σ = 56698342046640. Its totient is φ = 35993269678080.
The previous prime is 46120014021353. The next prime is 46120014021451. The reversal of 46120014021365 is 56312041002164.
46120014021365 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 27005472629041 + 19114541392324 = 5196679^2 + 4372018^2 .
It is not a de Polignac number, because 46120014021365 - 212 = 46120014017269 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6263744 + ... + 11466233.
It is an arithmetic number, because the mean of its divisors is an integer number (3543646377915).
Almost surely, 246120014021365 is an apocalyptic number.
It is an amenable number.
46120014021365 is a deficient number, since it is larger than the sum of its proper divisors (10578328025275).
46120014021365 is a wasteful number, since it uses less digits than its factorization.
46120014021365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17742712.
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 46120014021365 in words is "forty-six trillion, one hundred twenty billion, fourteen million, twenty-one thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •