Base | Representation |
---|---|
bin | 1001001110010010100011… |
… | …1010001111110000111111 |
3 | 1022220110221222120102121102 |
4 | 2103210220322033300333 |
5 | 2312122440130042143 |
6 | 33322431532323315 |
7 | 2064446004644531 |
oct | 223445072176077 |
9 | 38813858512542 |
10 | 10141104143423 |
11 | 325a8aaa02490 |
12 | 11794b731353b |
13 | 5873c06bc106 |
14 | 270b91257851 |
15 | 128bd7a680b8 |
hex | 93928e8fc3f |
10141104143423 has 8 divisors (see below), whose sum is σ = 11063323826256. Its totient is φ = 9218934648000.
The previous prime is 10141104143407. The next prime is 10141104143447. The reversal of 10141104143423 is 32434140114101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10141104143423 - 24 = 10141104143407 is a prime.
It is a super-2 number, since 2×101411041434232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141104143473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12123728 + ... + 12933173.
It is an arithmetic number, because the mean of its divisors is an integer number (1382915478282).
Almost surely, 210141104143423 is an apocalyptic number.
10141104143423 is a deficient number, since it is larger than the sum of its proper divisors (922219682833).
10141104143423 is a wasteful number, since it uses less digits than its factorization.
10141104143423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25093705.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 10141104143423 its reverse (32434140114101), we get a palindrome (42575244257524).
The spelling of 10141104143423 in words is "ten trillion, one hundred forty-one billion, one hundred four million, one hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •