Base | Representation |
---|---|
bin | 100000111110111001110010… |
… | …110010001101110001010011 |
3 | 201000121121121100111022102122 |
4 | 200332321302302031301103 |
5 | 123003131142203040311 |
6 | 1232303414041004455 |
7 | 42361151530013363 |
oct | 4076716262156123 |
9 | 630547540438378 |
10 | 145060151221331 |
11 | 42247734721675 |
12 | 1432976718372b |
13 | 62c316266a908 |
14 | 27b6d3d64c9a3 |
15 | 11b85328820db |
hex | 83ee72c8dc53 |
145060151221331 has 16 divisors (see below), whose sum is σ = 154059952969440. Its totient is φ = 136112237015040.
The previous prime is 145060151221309. The next prime is 145060151221357. The reversal of 145060151221331 is 133122151060541.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 145060151221331 - 238 = 144785273314387 is a prime.
It is a super-2 number, since 2×1450601512213312 (a number of 29 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 = 145060151221291 and 145060151221300.
It is not an unprimeable number, because it can be changed into a prime (145060151221301) 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, 353896655 + ... + 354306311.
It is an arithmetic number, because the mean of its divisors is an integer number (9628747060590).
Almost surely, 2145060151221331 is an apocalyptic number.
145060151221331 is a deficient number, since it is larger than the sum of its proper divisors (8999801748109).
145060151221331 is a wasteful number, since it uses less digits than its factorization.
145060151221331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472934.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 145060151221331 in words is "one hundred forty-five trillion, sixty billion, one hundred fifty-one million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •