Base | Representation |
---|---|
bin | 1001011111111011000111… |
… | …1010010101000010000110 |
3 | 1100222102220211022110220021 |
4 | 2113332301322111002012 |
5 | 2332103403342314220 |
6 | 34113532553125354 |
7 | 2125362206154256 |
oct | 227766172250206 |
9 | 40872824273807 |
10 | 10444050354310 |
11 | 336732a170611 |
12 | 12081633b985a |
13 | 5a9b3ca1b271 |
14 | 2816cd79d966 |
15 | 131a18be34aa |
hex | 97fb1e95086 |
10444050354310 has 64 divisors (see below), whose sum is σ = 19523658588480. Its totient is φ = 4017788006400.
The previous prime is 10444050354293. The next prime is 10444050354313. The reversal of 10444050354310 is 1345305044401.
It is a super-2 number, since 2×104440503543102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10444050354313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 229855354 + ... + 229900786.
It is an arithmetic number, because the mean of its divisors is an integer number (305057165445).
Almost surely, 210444050354310 is an apocalyptic number.
10444050354310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10444050354310 is a deficient number, since it is larger than the sum of its proper divisors (9079608234170).
10444050354310 is a wasteful number, since it uses less digits than its factorization.
10444050354310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48553.
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 10444050354310 its reverse (1345305044401), we get a palindrome (11789355398711).
The spelling of 10444050354310 in words is "ten trillion, four hundred forty-four billion, fifty million, three hundred fifty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •