Base | Representation |
---|---|
bin | 10111110000111110111001… |
… | …000000010011000111011111 |
3 | 111201002010022110201011012011 |
4 | 113300332321000103013133 |
5 | 102144433240022331143 |
6 | 1010144202353452051 |
7 | 31005255053515162 |
oct | 2760767100230737 |
9 | 451063273634164 |
10 | 104521133011423 |
11 | 303381887a7537 |
12 | b880a8bb71027 |
13 | 46423ba40561b |
14 | 1bb4bc7d0dad9 |
15 | c13c7b830e9d |
hex | 5f0fb90131df |
104521133011423 has 4 divisors (see below), whose sum is σ = 104658480098928. Its totient is φ = 104383785923920.
The previous prime is 104521133011409. The next prime is 104521133011447. The reversal of 104521133011423 is 324110331125401.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104521133011423 - 229 = 104520596140511 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104521133011453) 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, 68673542611 + ... + 68673544132.
It is an arithmetic number, because the mean of its divisors is an integer number (26164620024732).
Almost surely, 2104521133011423 is an apocalyptic number.
104521133011423 is a deficient number, since it is larger than the sum of its proper divisors (137347087505).
104521133011423 is an equidigital number, since it uses as much as digits as its factorization.
104521133011423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137347087504.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 104521133011423 its reverse (324110331125401), we get a palindrome (428631464136824).
The spelling of 104521133011423 in words is "one hundred four trillion, five hundred twenty-one billion, one hundred thirty-three million, eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •