Base | Representation |
---|---|
bin | 10010110100111010110101… |
… | …11010010101000101000011 |
3 | 12102120212111000022220000020 |
4 | 21122131122322111011003 |
5 | 20411302131020200100 |
6 | 224015120444024523 |
7 | 11502050212125132 |
oct | 1132353272250503 |
9 | 172525430286006 |
10 | 41400715006275 |
11 | 12211a43341139 |
12 | 478789b832143 |
13 | 1a140bc366171 |
14 | a31b3ba47919 |
15 | 4bbddaa155a0 |
hex | 25a75ae95143 |
41400715006275 has 12 divisors (see below), whose sum is σ = 68449182143832. Its totient is φ = 22080381336640.
The previous prime is 41400715006187. The next prime is 41400715006283. The reversal of 41400715006275 is 57260051700414.
41400715006275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 41400715006275 - 220 = 41400713957699 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 276004766634 + ... + 276004766783.
It is an arithmetic number, because the mean of its divisors is an integer number (5704098511986).
Almost surely, 241400715006275 is an apocalyptic number.
41400715006275 is a deficient number, since it is larger than the sum of its proper divisors (27048467137557).
41400715006275 is a wasteful number, since it uses less digits than its factorization.
41400715006275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552009533430 (or 552009533425 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 42.
Adding to 41400715006275 its reverse (57260051700414), we get a palindrome (98660766706689).
The spelling of 41400715006275 in words is "forty-one trillion, four hundred billion, seven hundred fifteen million, six thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •