Base | Representation |
---|---|
bin | 111001100100110111000101… |
… | …0111101100011110100011001 |
3 | 2110102011111221022122010202002 |
4 | 1303021232022331203310121 |
5 | 1012340032040411214040 |
6 | 4553040515223450345 |
7 | 211450220400226163 |
oct | 16311561275436431 |
9 | 2412144838563662 |
10 | 506443400101145 |
11 | 13740649244aa01 |
12 | 48974159bb69b5 |
13 | 1897853b974230 |
14 | 8d0bdc43b1933 |
15 | 3d83b4d4dda15 |
hex | 1cc9b8af63d19 |
506443400101145 has 32 divisors (see below), whose sum is σ = 666842455851264. Its totient is φ = 366925389292800.
The previous prime is 506443400101087. The next prime is 506443400101147. The reversal of 506443400101145 is 541101004344605.
It is not a de Polignac number, because 506443400101145 - 218 = 506443399839001 is a prime.
It is a super-2 number, since 2×5064434001011452 (a number of 30 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 = 506443400101099 and 506443400101108.
It is not an unprimeable number, because it can be changed into a prime (506443400101147) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 177695210 + ... + 180522780.
It is an arithmetic number, because the mean of its divisors is an integer number (20838826745352).
Almost surely, 2506443400101145 is an apocalyptic number.
It is an amenable number.
506443400101145 is a deficient number, since it is larger than the sum of its proper divisors (160399055750119).
506443400101145 is a wasteful number, since it uses less digits than its factorization.
506443400101145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2879633.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 506443400101145 in words is "five hundred six trillion, four hundred forty-three billion, four hundred million, one hundred one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •