Base | Representation |
---|---|
bin | 100000010100111110110… |
… | …0010101100001110111100 |
3 | 120201202102110002101111110 |
4 | 1000221331202230032330 |
5 | 1040243433210231030 |
6 | 13241044424522020 |
7 | 636001135343553 |
oct | 100517542541674 |
9 | 16652373071443 |
10 | 4443102430140 |
11 | 1463344543760 |
12 | 5b912a020310 |
13 | 262ca11854ba |
14 | 115093b3ad9a |
15 | 7a8969141b0 |
hex | 40a7d8ac3bc |
4443102430140 has 96 divisors (see below), whose sum is σ = 13735172457216. Its totient is φ = 1064138429440.
The previous prime is 4443102430087. The next prime is 4443102430147. The reversal of 4443102430140 is 410342013444.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 4443102430098 and 4443102430107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4443102430147) 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, 40499277 + ... + 40608836.
It is an arithmetic number, because the mean of its divisors is an integer number (143074713096).
Almost surely, 24443102430140 is an apocalyptic number.
It is an amenable number.
4443102430140 is an abundant number, since it is smaller than the sum of its proper divisors (9292070027076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4443102430140 is a wasteful number, since it uses less digits than its factorization.
4443102430140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81108219 (or 81108217 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 4443102430140 its reverse (410342013444), we get a palindrome (4853444443584).
The spelling of 4443102430140 in words is "four trillion, four hundred forty-three billion, one hundred two million, four hundred thirty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •