Base | Representation |
---|---|
bin | 10111001100111100010001… |
… | …100101110110100011101010 |
3 | 111101022100111022002202021101 |
4 | 113030330101211312203222 |
5 | 101333343434304334010 |
6 | 1001010321045232014 |
7 | 30331315635015100 |
oct | 2714742145664352 |
9 | 441270438082241 |
10 | 102044423121130 |
11 | 2a572884617406 |
12 | b540a86a0260a |
13 | 44c2994c297b9 |
14 | 1b2ad95485c70 |
15 | bbe62273873a |
hex | 5ccf119768ea |
102044423121130 has 48 divisors (see below), whose sum is σ = 214217803598760. Its totient is φ = 34896719292288.
The previous prime is 102044423121101. The next prime is 102044423121133. The reversal of 102044423121130 is 31121324440201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 59436806563729 + 42607616557401 = 7709527^2 + 6527451^2 .
It is not an unprimeable number, because it can be changed into a prime (102044423121133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 267487957 + ... + 267869176.
Almost surely, 2102044423121130 is an apocalyptic number.
102044423121130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102044423121130 is an abundant number, since it is smaller than the sum of its proper divisors (112173380477630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102044423121130 is a wasteful number, since it uses less digits than its factorization.
102044423121130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535357543 (or 535357536 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 102044423121130 its reverse (31121324440201), we get a palindrome (133165747561331).
The spelling of 102044423121130 in words is "one hundred two trillion, forty-four billion, four hundred twenty-three million, one hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •