Base | Representation |
---|---|
bin | 100001000010101101101011… |
… | …101011100110111101100011 |
3 | 201001112122112210022100221010 |
4 | 201002231223223212331203 |
5 | 123021424001403212201 |
6 | 1233024003334032003 |
7 | 42416112152611266 |
oct | 4102555353467543 |
9 | 631478483270833 |
10 | 145322025054051 |
11 | 423387a767310a |
12 | 143704701a8603 |
13 | 6311a676b8211 |
14 | 27c58a2dd8cdd |
15 | 11c025cce8bd6 |
hex | 842b6bae6f63 |
145322025054051 has 8 divisors (see below), whose sum is σ = 193866482993344. Its totient is φ = 96829458575400.
The previous prime is 145322025053939. The next prime is 145322025054077. The reversal of 145322025054051 is 150450520223541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145322025054051 - 213 = 145322025045859 is a prime.
It is a super-2 number, since 2×1453220250540512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145322025054091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12972858625 + ... + 12972869826.
It is an arithmetic number, because the mean of its divisors is an integer number (24233310374168).
Almost surely, 2145322025054051 is an apocalyptic number.
145322025054051 is a deficient number, since it is larger than the sum of its proper divisors (48544457939293).
145322025054051 is a wasteful number, since it uses less digits than its factorization.
145322025054051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25945730321.
The product of its (nonzero) digits is 240000, while the sum is 39.
Adding to 145322025054051 its reverse (150450520223541), we get a palindrome (295772545277592).
The spelling of 145322025054051 in words is "one hundred forty-five trillion, three hundred twenty-two billion, twenty-five million, fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •