Base | Representation |
---|---|
bin | 100001001101011000011100… |
… | …111111010101000100101101 |
3 | 201011010201212010101021201020 |
4 | 201031120130333111010231 |
5 | 123120431413410344323 |
6 | 1234344450150204353 |
7 | 42523064426032530 |
oct | 4115303477250455 |
9 | 634121763337636 |
10 | 146055144231213 |
11 | 425a07032a57a8 |
12 | 1446a5703536b9 |
13 | 6365c304cacb9 |
14 | 280d16cad4a17 |
15 | 11d4369760ae3 |
hex | 84d61cfd512d |
146055144231213 has 128 divisors (see below), whose sum is σ = 238660618420224. Its totient is φ = 77689389254400.
The previous prime is 146055144231211. The next prime is 146055144231229. The reversal of 146055144231213 is 312132441550641.
146055144231213 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 146055144231213 - 21 = 146055144231211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146055144231211) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 7897851795 + ... + 7897870287.
It is an arithmetic number, because the mean of its divisors is an integer number (1864536081408).
Almost surely, 2146055144231213 is an apocalyptic number.
It is an amenable number.
146055144231213 is a deficient number, since it is larger than the sum of its proper divisors (92605474189011).
146055144231213 is a wasteful number, since it uses less digits than its factorization.
146055144231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22855.
The product of its (nonzero) digits is 345600, while the sum is 42.
Adding to 146055144231213 its reverse (312132441550641), we get a palindrome (458187585781854).
The spelling of 146055144231213 in words is "one hundred forty-six trillion, fifty-five billion, one hundred forty-four million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •