Base | Representation |
---|---|
bin | 110010011000001000010101… |
… | …1111000001011111001101101 |
3 | 2011002221222000111021000200121 |
4 | 1210300100223320023321231 |
5 | 431040044004103341023 |
6 | 4210235005103124541 |
7 | 162223304665251535 |
oct | 14460205370137155 |
9 | 2132858014230617 |
10 | 443121102012013 |
11 | 119212670a40497 |
12 | 41847a085a3751 |
13 | 160341a9c36189 |
14 | 7b5d2664664c5 |
15 | 36368e4176d5d |
hex | 193042be0be6d |
443121102012013 has 16 divisors (see below), whose sum is σ = 448563529020096. Its totient is φ = 437696789644800.
The previous prime is 443121102011981. The next prime is 443121102012157. The reversal of 443121102012013 is 310210201121344.
It is a cyclic number.
It is not a de Polignac number, because 443121102012013 - 25 = 443121102011981 is a prime.
It is a super-2 number, since 2×4431211020120132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (443121102012313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 310625670 + ... + 312048952.
It is an arithmetic number, because the mean of its divisors is an integer number (28035220563756).
Almost surely, 2443121102012013 is an apocalyptic number.
It is an amenable number.
443121102012013 is a deficient number, since it is larger than the sum of its proper divisors (5442427008083).
443121102012013 is a wasteful number, since it uses less digits than its factorization.
443121102012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1429644.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 443121102012013 its reverse (310210201121344), we get a palindrome (753331303133357).
The spelling of 443121102012013 in words is "four hundred forty-three trillion, one hundred twenty-one billion, one hundred two million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •