Base | Representation |
---|---|
bin | 11110011001001010111… |
… | …00010111000100001111 |
3 | 10200211112102120001001222 |
4 | 33030211130113010033 |
5 | 114102214120310211 |
6 | 2115425221353555 |
7 | 135306600054611 |
oct | 17144534270417 |
9 | 3624472501058 |
10 | 1044305244431 |
11 | 3729840a3889 |
12 | 14a4878688bb |
13 | 776292856c7 |
14 | 3878a704db1 |
15 | 1c2711bb1db |
hex | f32571710f |
1044305244431 has 4 divisors (see below), whose sum is σ = 1053886026600. Its totient is φ = 1034724462264.
The previous prime is 1044305244407. The next prime is 1044305244443. The reversal of 1044305244431 is 1344425034401.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1044305244431 - 222 = 1044301050127 is a prime.
It is a super-2 number, since 2×10443052444312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1044305244391 and 1044305244400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1049305244431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4790390921 + ... + 4790391138.
It is an arithmetic number, because the mean of its divisors is an integer number (263471506650).
Almost surely, 21044305244431 is an apocalyptic number.
1044305244431 is a deficient number, since it is larger than the sum of its proper divisors (9580782169).
1044305244431 is an equidigital number, since it uses as much as digits as its factorization.
1044305244431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9580782168.
The product of its (nonzero) digits is 92160, while the sum is 35.
The spelling of 1044305244431 in words is "one trillion, forty-four billion, three hundred five million, two hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •