Base | Representation |
---|---|
bin | 10010101001111011100000… |
… | …01001001111001111111011 |
3 | 12101020202211100122002102102 |
4 | 21110331300021033033323 |
5 | 20334110314203122133 |
6 | 223125431454254015 |
7 | 11432552003400245 |
oct | 1124756011171773 |
9 | 171222740562372 |
10 | 41023114114043 |
11 | 120868944a0a56 |
12 | 4726679ab730b |
13 | 19b7603468259 |
14 | a1b75a637095 |
15 | 4b218a7d47e8 |
hex | 254f7024f3fb |
41023114114043 has 2 divisors, whose sum is σ = 41023114114044. Its totient is φ = 41023114114042.
The previous prime is 41023114114001. The next prime is 41023114114051. The reversal of 41023114114043 is 34041141132014.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 41023114114043 - 230 = 41022040372219 is a prime.
It is a super-3 number, since 3×410231141140433 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 41023114113997 and 41023114114015.
It is not a weakly prime, because it can be changed into another prime (41023114113043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20511557057021 + 20511557057022.
It is an arithmetic number, because the mean of its divisors is an integer number (20511557057022).
Almost surely, 241023114114043 is an apocalyptic number.
41023114114043 is a deficient number, since it is larger than the sum of its proper divisors (1).
41023114114043 is an equidigital number, since it uses as much as digits as its factorization.
41023114114043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 41023114114043 its reverse (34041141132014), we get a palindrome (75064255246057).
The spelling of 41023114114043 in words is "forty-one trillion, twenty-three billion, one hundred fourteen million, one hundred fourteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •