Base | Representation |
---|---|
bin | 110000011011110101… |
… | …1011001111100001111 |
3 | 100221110212110011022220 |
4 | 1200313223121330033 |
5 | 3201004403343211 |
6 | 115441050510423 |
7 | 10341355543320 |
oct | 1406753317417 |
9 | 327425404286 |
10 | 104013340431 |
11 | 40125901180 |
12 | 181a9a35413 |
13 | 9a681222b0 |
14 | 506a088447 |
15 | 2a8b747806 |
hex | 1837ad9f0f |
104013340431 has 128 divisors (see below), whose sum is σ = 192662378496. Its totient is φ = 48167239680.
The previous prime is 104013340411. The next prime is 104013340493. The reversal of 104013340431 is 134043310401.
It is not a de Polignac number, because 104013340431 - 210 = 104013339407 is a prime.
It is a super-2 number, since 2×1040133404312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104013340411) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 15218791 + ... + 15225623.
It is an arithmetic number, because the mean of its divisors is an integer number (1505174832).
Almost surely, 2104013340431 is an apocalyptic number.
104013340431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104013340431 is a deficient number, since it is larger than the sum of its proper divisors (88649038065).
104013340431 is a wasteful number, since it uses less digits than its factorization.
104013340431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7041.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 104013340431 its reverse (134043310401), we get a palindrome (238056650832).
It can be divided in two parts, 104013 and 340431, that added together give a palindrome (444444).
The spelling of 104013340431 in words is "one hundred four billion, thirteen million, three hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •