Base | Representation |
---|---|
bin | 10010101100010100010011… |
… | …11100010100110100100001 |
3 | 12101112121120200002201002022 |
4 | 21112022021330110310201 |
5 | 20341431322214041413 |
6 | 223231240144231225 |
7 | 11441514653164025 |
oct | 1126121174246441 |
9 | 171477520081068 |
10 | 41105151315233 |
11 | 12108662343485 |
12 | 473a55400b515 |
13 | 19c2278671055 |
14 | a216ddb92385 |
15 | 4b438ca63608 |
hex | 256289f14d21 |
41105151315233 has 2 divisors, whose sum is σ = 41105151315234. Its totient is φ = 41105151315232.
The previous prime is 41105151315227. The next prime is 41105151315251. The reversal of 41105151315233 is 33251315150114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27173617460224 + 13931533855009 = 5212832^2 + 3732497^2 .
It is a cyclic number.
It is not a de Polignac number, because 41105151315233 - 218 = 41105151053089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41105151315193 and 41105151315202.
It is not a weakly prime, because it can be changed into another prime (41105151314233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20552575657616 + 20552575657617.
It is an arithmetic number, because the mean of its divisors is an integer number (20552575657617).
Almost surely, 241105151315233 is an apocalyptic number.
It is an amenable number.
41105151315233 is a deficient number, since it is larger than the sum of its proper divisors (1).
41105151315233 is an equidigital number, since it uses as much as digits as its factorization.
41105151315233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27000, while the sum is 35.
Adding to 41105151315233 its reverse (33251315150114), we get a palindrome (74356466465347).
The spelling of 41105151315233 in words is "forty-one trillion, one hundred five billion, one hundred fifty-one million, three hundred fifteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •