Base | Representation |
---|---|
bin | 100110001100101000… |
… | …011000000111000111 |
3 | 10220212100021011202102 |
4 | 212030220120013013 |
5 | 1132444102203143 |
6 | 30501442302315 |
7 | 2651240046542 |
oct | 461450300707 |
9 | 126770234672 |
10 | 41014100423 |
11 | 1643743276a |
12 | 7b4765799b |
13 | 3b381b879a |
14 | 1db1149859 |
15 | 1100a510b8 |
hex | 98ca181c7 |
41014100423 has 4 divisors (see below), whose sum is σ = 41014576560. Its totient is φ = 41013624288.
The previous prime is 41014100419. The next prime is 41014100497. The reversal of 41014100423 is 32400141014.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 32400141014 = 2 ⋅16200070507.
It is a cyclic number.
It is not a de Polignac number, because 41014100423 - 22 = 41014100419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41014100395 and 41014100404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41014100623) 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, 68690 + ... + 294527.
It is an arithmetic number, because the mean of its divisors is an integer number (10253644140).
Almost surely, 241014100423 is an apocalyptic number.
41014100423 is a deficient number, since it is larger than the sum of its proper divisors (476137).
41014100423 is a wasteful number, since it uses less digits than its factorization.
41014100423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476136.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 41014100423 its reverse (32400141014), we get a palindrome (73414241437).
The spelling of 41014100423 in words is "forty-one billion, fourteen million, one hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •