Base | Representation |
---|---|
bin | 1001001000011011100001… |
… | …0110011000010100111111 |
3 | 1022112212002221010111000211 |
4 | 2102012320112120110333 |
5 | 2304000300422222221 |
6 | 33204302135133251 |
7 | 2054253152065201 |
oct | 222067026302477 |
9 | 38485087114024 |
10 | 10040431445311 |
11 | 3221139885333 |
12 | 1161aa0214227 |
13 | 57aa6870c167 |
14 | 269d60b28771 |
15 | 1262947506e1 |
hex | 921b859853f |
10040431445311 has 4 divisors (see below), whose sum is σ = 10085455801792. Its totient is φ = 9995407088832.
The previous prime is 10040431445309. The next prime is 10040431445357. The reversal of 10040431445311 is 11354413404001.
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 10040431445311 - 21 = 10040431445309 is a prime.
It is a super-5 number, since 5×100404314453115 (a number of 66 digits) contains 55555 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10040431445711) 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, 22512177906 + ... + 22512178351.
It is an arithmetic number, because the mean of its divisors is an integer number (2521363950448).
Almost surely, 210040431445311 is an apocalyptic number.
10040431445311 is a deficient number, since it is larger than the sum of its proper divisors (45024356481).
10040431445311 is an equidigital number, since it uses as much as digits as its factorization.
10040431445311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45024356480.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 10040431445311 its reverse (11354413404001), we get a palindrome (21394844849312).
The spelling of 10040431445311 in words is "ten trillion, forty billion, four hundred thirty-one million, four hundred forty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •