Base | Representation |
---|---|
bin | 1000001101010001… |
… | …10110110000010111 |
3 | 102101002022022000011 |
4 | 10012220312300113 |
5 | 33011010400011 |
6 | 2005123101051 |
7 | 214123164100 |
oct | 40650666027 |
9 | 12332268004 |
10 | 4406340631 |
11 | 196129aa30 |
12 | a2b811787 |
13 | 552b73064 |
14 | 2db2c93a7 |
15 | 1abc8c621 |
hex | 106a36c17 |
4406340631 has 12 divisors (see below), whose sum is σ = 5591720520. Its totient is φ = 3433511760.
The previous prime is 4406340613. The next prime is 4406340637. The reversal of 4406340631 is 1360436044.
It is a happy number.
It is not a de Polignac number, because 4406340631 - 25 = 4406340599 is a prime.
It is a super-2 number, since 2×44063406312 = 38831675512802956322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4406340593 and 4406340602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4406340637) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4086976 + ... + 4088053.
It is an arithmetic number, because the mean of its divisors is an integer number (465976710).
Almost surely, 24406340631 is an apocalyptic number.
4406340631 is a deficient number, since it is larger than the sum of its proper divisors (1185379889).
4406340631 is a wasteful number, since it uses less digits than its factorization.
4406340631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8175054 (or 8175047 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
The square root of 4406340631 is about 66380.2729054348. The cubic root of 4406340631 is about 1639.4292867186.
Adding to 4406340631 its reverse (1360436044), we get a palindrome (5766776675).
The spelling of 4406340631 in words is "four billion, four hundred six million, three hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •