Base | Representation |
---|---|
bin | 1001001110010010111111… |
… | …1001100101100011001111 |
3 | 1022220111021011020020111212 |
4 | 2103210233321211203033 |
5 | 2312123210140123043 |
6 | 33322451322005035 |
7 | 2064451630465553 |
oct | 223445771454317 |
9 | 38814234206455 |
10 | 10141221411023 |
11 | 325a96011835a |
12 | 117952a64677b |
13 | 58740ba9a421 |
14 | 270ba2a61863 |
15 | 128be2ece018 |
hex | 9392fe658cf |
10141221411023 has 8 divisors (see below), whose sum is σ = 10676413983600. Its totient is φ = 9606173246208.
The previous prime is 10141221411007. The next prime is 10141221411037. The reversal of 10141221411023 is 32011412214101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10141221411023 - 24 = 10141221411007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10141221411023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141221411053) 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, 35957768 + ... + 36238701.
It is an arithmetic number, because the mean of its divisors is an integer number (1334551747950).
Almost surely, 210141221411023 is an apocalyptic number.
10141221411023 is a deficient number, since it is larger than the sum of its proper divisors (535192572577).
10141221411023 is an equidigital number, since it uses as much as digits as its factorization.
10141221411023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72203881.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 10141221411023 its reverse (32011412214101), we get a palindrome (42152633625124).
The spelling of 10141221411023 in words is "ten trillion, one hundred forty-one billion, two hundred twenty-one million, four hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •