Base | Representation |
---|---|
bin | 110000000111100010… |
… | …1111101000111111111 |
3 | 100212201102012112220011 |
4 | 1200033011331013333 |
5 | 3143111100400211 |
6 | 115245324404051 |
7 | 10315450125532 |
oct | 1401705750777 |
9 | 325642175804 |
10 | 103332434431 |
11 | 3a906513446 |
12 | 180399a6627 |
13 | 998a039b35 |
14 | 5003880a19 |
15 | 2a4ba97921 |
hex | 180f17d1ff |
103332434431 has 8 divisors (see below), whose sum is σ = 103512499200. Its totient is φ = 103152422520.
The previous prime is 103332434417. The next prime is 103332434437. The reversal of 103332434431 is 134434233301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103332434431 - 25 = 103332434399 is a prime.
It is a super-2 number, since 2×1033324344312 (a number of 23 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 = 103332434393 and 103332434402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103332434437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7109790 + ... + 7124308.
It is an arithmetic number, because the mean of its divisors is an integer number (12939062400).
Almost surely, 2103332434431 is an apocalyptic number.
103332434431 is a deficient number, since it is larger than the sum of its proper divisors (180064769).
103332434431 is a wasteful number, since it uses less digits than its factorization.
103332434431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26429.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 103332434431 its reverse (134434233301), we get a palindrome (237766667732).
The spelling of 103332434431 in words is "one hundred three billion, three hundred thirty-two million, four hundred thirty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •