Base | Representation |
---|---|
bin | 110000000111100010… |
… | …1111001101101011001 |
3 | 100212201102011211201000 |
4 | 1200033011321231121 |
5 | 3143111044423231 |
6 | 115245324215213 |
7 | 10315450036665 |
oct | 1401705715531 |
9 | 325642154630 |
10 | 103332420441 |
11 | 3a906503988 |
12 | 1803999a509 |
13 | 998a033663 |
14 | 50038798a5 |
15 | 2a4ba936e6 |
hex | 180f179b59 |
103332420441 has 64 divisors (see below), whose sum is σ = 163444469760. Its totient is φ = 64296529920.
The previous prime is 103332420437. The next prime is 103332420469. The reversal of 103332420441 is 144024233301.
It is not a de Polignac number, because 103332420441 - 22 = 103332420437 is a prime.
It is a super-2 number, since 2×1033324204412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (103332420041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 30470856 + ... + 30474246.
It is an arithmetic number, because the mean of its divisors is an integer number (2553819840).
Almost surely, 2103332420441 is an apocalyptic number.
It is an amenable number.
103332420441 is a deficient number, since it is larger than the sum of its proper divisors (60112049319).
103332420441 is a wasteful number, since it uses less digits than its factorization.
103332420441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3951 (or 3945 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 103332420441 its reverse (144024233301), we get a palindrome (247356653742).
The spelling of 103332420441 in words is "one hundred three billion, three hundred thirty-two million, four hundred twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •