Base | Representation |
---|---|
bin | 1010101001101001000010… |
… | …01111100110010000110101 |
3 | 10001221000201202121101102121 |
4 | 11110310201033212100311 |
5 | 11032212214141331401 |
6 | 121451244313235541 |
7 | 4635053366450311 |
oct | 524644117462065 |
9 | 101830652541377 |
10 | 23421014402101 |
11 | 750a884055478 |
12 | 2763196402bb1 |
13 | 100b79103a214 |
14 | 5ad824218b41 |
15 | 2a937ad17ca1 |
hex | 154d213e6435 |
23421014402101 has 4 divisors (see below), whose sum is σ = 23514325216704. Its totient is φ = 23327703587500.
The previous prime is 23421014402087. The next prime is 23421014402147. The reversal of 23421014402101 is 10120441012432.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23421014402101 - 27 = 23421014401973 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 (23421014402171) 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, 46655406925 + ... + 46655407426.
It is an arithmetic number, because the mean of its divisors is an integer number (5878581304176).
Almost surely, 223421014402101 is an apocalyptic number.
It is an amenable number.
23421014402101 is a deficient number, since it is larger than the sum of its proper divisors (93310814603).
23421014402101 is an equidigital number, since it uses as much as digits as its factorization.
23421014402101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93310814602.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 23421014402101 its reverse (10120441012432), we get a palindrome (33541455414533).
The spelling of 23421014402101 in words is "twenty-three trillion, four hundred twenty-one billion, fourteen million, four hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •