Base | Representation |
---|---|
bin | 100001000001000101101011… |
… | …100101101011111110001101 |
3 | 201001010222022021011221012210 |
4 | 201001011223211223332031 |
5 | 123013111301203231023 |
6 | 1232500414343221033 |
7 | 42405046643401356 |
oct | 4101055345537615 |
9 | 631128267157183 |
10 | 145210354352013 |
11 | 422a5402450915 |
12 | 143528a5a47779 |
13 | 630437c02c332 |
14 | 27c030bd98d2d |
15 | 11bc3c41d8593 |
hex | 84116b96bf8d |
145210354352013 has 32 divisors (see below), whose sum is σ = 195654395577600. Its totient is φ = 95787838080000.
The previous prime is 145210354351903. The next prime is 145210354352047. The reversal of 145210354352013 is 310253453012541.
145210354352013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 145210354352013 - 210 = 145210354350989 is a prime.
It is a super-2 number, since 2×1452103543520132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145210354352093) 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, 3873393573 + ... + 3873431061.
It is an arithmetic number, because the mean of its divisors is an integer number (6114199861800).
Almost surely, 2145210354352013 is an apocalyptic number.
It is an amenable number.
145210354352013 is a deficient number, since it is larger than the sum of its proper divisors (50444041225587).
145210354352013 is a wasteful number, since it uses less digits than its factorization.
145210354352013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45333.
The product of its (nonzero) digits is 216000, while the sum is 39.
The spelling of 145210354352013 in words is "one hundred forty-five trillion, two hundred ten billion, three hundred fifty-four million, three hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •