Base | Representation |
---|---|
bin | 10111000011111010011111… |
… | …100001111110110010001001 |
3 | 111022010001011022220211212122 |
4 | 113003322133201332302021 |
5 | 101243212410224304001 |
6 | 555413320314021025 |
7 | 30235434055216163 |
oct | 2703723741766211 |
9 | 438101138824778 |
10 | 101424034213001 |
11 | 2a353767215415 |
12 | b4607a7a17775 |
13 | 4479326167916 |
14 | 1b08d41401933 |
15 | bad41292cb1b |
hex | 5c3e9f87ec89 |
101424034213001 has 4 divisors (see below), whose sum is σ = 103143085640400. Its totient is φ = 99704982785604.
The previous prime is 101424034212989. The next prime is 101424034213039. The reversal of 101424034213001 is 100312430424101.
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 101424034213001 - 238 = 101149156306057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101424034213501) 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, 859525713611 + ... + 859525713728.
It is an arithmetic number, because the mean of its divisors is an integer number (25785771410100).
Almost surely, 2101424034213001 is an apocalyptic number.
It is an amenable number.
101424034213001 is a deficient number, since it is larger than the sum of its proper divisors (1719051427399).
101424034213001 is an equidigital number, since it uses as much as digits as its factorization.
101424034213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1719051427398.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 101424034213001 its reverse (100312430424101), we get a palindrome (201736464637102).
The spelling of 101424034213001 in words is "one hundred one trillion, four hundred twenty-four billion, thirty-four million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •