Base | Representation |
---|---|
bin | 100000111110110101100100… |
… | …001100100100000000001110 |
3 | 201000121011212222012201002002 |
4 | 200332311210030210000032 |
5 | 123003042343021040411 |
6 | 1232301343351032302 |
7 | 42360631164026000 |
oct | 4076654414440016 |
9 | 630534788181062 |
10 | 145055611502606 |
11 | 42245815112812 |
12 | 143288ba96b692 |
13 | 62c28bac9860c |
14 | 27b6a2c764370 |
15 | 11b836904a33b |
hex | 83ed6432400e |
145055611502606 has 64 divisors (see below), whose sum is σ = 259984886716800. Its totient is φ = 60637719582720.
The previous prime is 145055611502597. The next prime is 145055611502629. The reversal of 145055611502606 is 606205116550541.
It is a super-2 number, since 2×1450556115026062 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 134269910 + ... + 135345926.
It is an arithmetic number, because the mean of its divisors is an integer number (4062263854950).
Almost surely, 2145055611502606 is an apocalyptic number.
145055611502606 is a deficient number, since it is larger than the sum of its proper divisors (114929275214194).
145055611502606 is a wasteful number, since it uses less digits than its factorization.
145055611502606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080874 (or 1080860 counting only the distinct ones).
The product of its (nonzero) digits is 1080000, while the sum is 47.
The spelling of 145055611502606 in words is "one hundred forty-five trillion, fifty-five billion, six hundred eleven million, five hundred two thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •