Base | Representation |
---|---|
bin | 110010000010010011010111… |
… | …1001110001100010000100000 |
3 | 2010201100011112211100012220102 |
4 | 1210010212233032030100200 |
5 | 430141421030101043112 |
6 | 4200020504115201532 |
7 | 161463462505256444 |
oct | 14404465716142040 |
9 | 2121304484305812 |
10 | 440121123456032 |
11 | 118266358290a47 |
12 | 414425098a62a8 |
13 | 15b773229a3a55 |
14 | 7a97d94352824 |
15 | 35d386176bbc2 |
hex | 19049af38c420 |
440121123456032 has 96 divisors (see below), whose sum is σ = 869119208141184. Its totient is φ = 219393615052800.
The previous prime is 440121123456023. The next prime is 440121123456037. The reversal of 440121123456032 is 230654321121044.
It is a super-2 number, since 2×4401211234560322 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (440121123456037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73932656768 + ... + 73932662720.
It is an arithmetic number, because the mean of its divisors is an integer number (9053325084804).
Almost surely, 2440121123456032 is an apocalyptic number.
It is an amenable number.
440121123456032 is a deficient number, since it is larger than the sum of its proper divisors (428998084685152).
440121123456032 is a wasteful number, since it uses less digits than its factorization.
440121123456032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11042 (or 11034 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 440121123456032 its reverse (230654321121044), we get a palindrome (670775444577076).
The spelling of 440121123456032 in words is "four hundred forty trillion, one hundred twenty-one billion, one hundred twenty-three million, four hundred fifty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •