Base | Representation |
---|---|
bin | 10100001110111010000000… |
… | …10001110011101111000100 |
3 | 12211112110021220101212221110 |
4 | 22013131000101303233010 |
5 | 21312431414011120234 |
6 | 234343345550245020 |
7 | 12241326132234264 |
oct | 1207350021635704 |
9 | 184473256355843 |
10 | 44492644629444 |
11 | 131a4251a773a0 |
12 | 4ba6b807b6770 |
13 | 1ba983b6c149b |
14 | adb653c177a4 |
15 | 522550be61e9 |
hex | 287740473bc4 |
44492644629444 has 48 divisors (see below), whose sum is σ = 114080676123456. Its totient is φ = 13384206297600.
The previous prime is 44492644629431. The next prime is 44492644629463.
44492644629444 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×444926446294442 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1230147937 + ... + 1230184104.
It is an arithmetic number, because the mean of its divisors is an integer number (2376680752572).
Almost surely, 244492644629444 is an apocalyptic number.
44492644629444 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
44492644629444 is an abundant number, since it is smaller than the sum of its proper divisors (69588031494012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44492644629444 is a wasteful number, since it uses less digits than its factorization.
44492644629444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2460332196 (or 2460332194 counting only the distinct ones).
The product of its digits is 764411904, while the sum is 66.
The spelling of 44492644629444 in words is "forty-four trillion, four hundred ninety-two billion, six hundred forty-four million, six hundred twenty-nine thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •