Base | Representation |
---|---|
bin | 10011011110111011… |
… | …11011011001100001 |
3 | 222222222102122111211 |
4 | 21233131323121201 |
5 | 132410233113131 |
6 | 4445535110121 |
7 | 520131652426 |
oct | 115735733141 |
9 | 28888378454 |
10 | 10460051041 |
11 | 4488476190 |
12 | 203b072341 |
13 | ca90c601b |
14 | 7132b9d4d |
15 | 4134845b1 |
hex | 26f77b661 |
10460051041 has 4 divisors (see below), whose sum is σ = 11410964784. Its totient is φ = 9509137300.
The previous prime is 10460050987. The next prime is 10460051051. The reversal of 10460051041 is 14015006401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10460051041 - 215 = 10460018273 is a prime.
It is a super-3 number, since 3×104600510413 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10460051051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 475456855 + ... + 475456876.
It is an arithmetic number, because the mean of its divisors is an integer number (2852741196).
Almost surely, 210460051041 is an apocalyptic number.
10460051041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10460051041 is a deficient number, since it is larger than the sum of its proper divisors (950913743).
10460051041 is an equidigital number, since it uses as much as digits as its factorization.
10460051041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950913742.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10460051041 its reverse (14015006401), we get a palindrome (24475057442).
The spelling of 10460051041 in words is "ten billion, four hundred sixty million, fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •