Base | Representation |
---|---|
bin | 1011110111011011100110… |
… | …1000110000000111001011 |
3 | 1201012021101222211221112101 |
4 | 2331312321220300013023 |
5 | 3202230103104130424 |
6 | 43425402120254231 |
7 | 2514416043302620 |
oct | 275667150600713 |
9 | 51167358757471 |
10 | 13046930145739 |
11 | 4180198a30906 |
12 | 15686ba611377 |
13 | 738421726519 |
14 | 331690b68347 |
15 | 1795a978a344 |
hex | bddb9a301cb |
13046930145739 has 4 divisors (see below), whose sum is σ = 14910777309424. Its totient is φ = 11183082982056.
The previous prime is 13046930145713. The next prime is 13046930145773. The reversal of 13046930145739 is 93754103964031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13046930145739 is a prime.
It is a super-2 number, since 2×130469301457392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13046930145739.
It is not an unprimeable number, because it can be changed into a prime (13046931145739) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 931923581832 + ... + 931923581845.
It is an arithmetic number, because the mean of its divisors is an integer number (3727694327356).
Almost surely, 213046930145739 is an apocalyptic number.
13046930145739 is a deficient number, since it is larger than the sum of its proper divisors (1863847163685).
13046930145739 is an equidigital number, since it uses as much as digits as its factorization.
13046930145739 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1863847163684.
The product of its (nonzero) digits is 7348320, while the sum is 55.
The spelling of 13046930145739 in words is "thirteen trillion, forty-six billion, nine hundred thirty million, one hundred forty-five thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •