Base | Representation |
---|---|
bin | 1001011110001000010011… |
… | …1001001110100110101001 |
3 | 1100212111100220222111222120 |
4 | 2113202010321032212221 |
5 | 2331102243430220131 |
6 | 34051434424541453 |
7 | 2123221361201043 |
oct | 227420471164651 |
9 | 40774326874876 |
10 | 10413230320041 |
11 | 335525405270a |
12 | 12021a1921889 |
13 | 5a6c6a7aa3b3 |
14 | 280008492a93 |
15 | 130d130d6496 |
hex | 97884e4e9a9 |
10413230320041 has 8 divisors (see below), whose sum is σ = 13888156375104. Its totient is φ = 6940228905840.
The previous prime is 10413230320019. The next prime is 10413230320109. The reversal of 10413230320041 is 14002303231401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10413230320041 - 27 = 10413230319913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10413230319993 and 10413230320020.
It is not an unprimeable number, because it can be changed into a prime (10413230320001) 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, 481147590 + ... + 481169231.
It is an arithmetic number, because the mean of its divisors is an integer number (1736019546888).
Almost surely, 210413230320041 is an apocalyptic number.
It is an amenable number.
10413230320041 is a deficient number, since it is larger than the sum of its proper divisors (3474926055063).
10413230320041 is an equidigital number, since it uses as much as digits as its factorization.
10413230320041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962320431.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10413230320041 its reverse (14002303231401), we get a palindrome (24415533551442).
The spelling of 10413230320041 in words is "ten trillion, four hundred thirteen billion, two hundred thirty million, three hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •