Base | Representation |
---|---|
bin | 10010001100001100110… |
… | …110100001011011101001 |
3 | 11102111121012200112222022 |
4 | 102030030312201123221 |
5 | 130440101040234231 |
6 | 2354133205234225 |
7 | 156212301024341 |
oct | 22141466413351 |
9 | 4374535615868 |
10 | 1250051102441 |
11 | 442164293169 |
12 | 182327702975 |
13 | 90b57b0a85b |
14 | 4470795bd21 |
15 | 227b3cc6c7b |
hex | 1230cda16e9 |
1250051102441 has 16 divisors (see below), whose sum is σ = 1336897267200. Its totient is φ = 1166239200000.
The previous prime is 1250051102437. The next prime is 1250051102467. The reversal of 1250051102441 is 1442011500521.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1250051102441 - 22 = 1250051102437 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1250051102441.
It is not an unprimeable number, because it can be changed into a prime (1250051102401) 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, 462560 + ... + 1647441.
It is an arithmetic number, because the mean of its divisors is an integer number (83556079200).
Almost surely, 21250051102441 is an apocalyptic number.
It is an amenable number.
1250051102441 is a deficient number, since it is larger than the sum of its proper divisors (86846164759).
1250051102441 is a wasteful number, since it uses less digits than its factorization.
1250051102441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2110720.
The product of its (nonzero) digits is 1600, while the sum is 26.
Adding to 1250051102441 its reverse (1442011500521), we get a palindrome (2692062602962).
The spelling of 1250051102441 in words is "one trillion, two hundred fifty billion, fifty-one million, one hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •