Base | Representation |
---|---|
bin | 10111000011111001101101… |
… | …111111001101010101110010 |
3 | 111022002222000101212120012112 |
4 | 113003321231333031111302 |
5 | 101243204204432422002 |
6 | 555413102022325322 |
7 | 30235404343151402 |
oct | 2703715577152562 |
9 | 438088011776175 |
10 | 101423203014002 |
11 | 2a3533800052a1 |
12 | b4605b5589842 |
13 | 4479222bb00ac |
14 | 1b08ca2c74802 |
15 | bad3b4991852 |
hex | 5c3e6dfcd572 |
101423203014002 has 8 divisors (see below), whose sum is σ = 152160038376300. Its totient is φ = 50703190221904.
The previous prime is 101423203013989. The next prime is 101423203014031. The reversal of 101423203014002 is 200410302324101.
It can be written as a sum of positive squares in 2 ways, for example, as 101335610100481 + 87592913521 = 10066559^2 + 295961^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1014232030140022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4205627477 + ... + 4205651592.
Almost surely, 2101423203014002 is an apocalyptic number.
101423203014002 is a deficient number, since it is larger than the sum of its proper divisors (50736835362298).
101423203014002 is an equidigital number, since it uses as much as digits as its factorization.
101423203014002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8411285100.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 101423203014002 its reverse (200410302324101), we get a palindrome (301833505338103).
The spelling of 101423203014002 in words is "one hundred one trillion, four hundred twenty-three billion, two hundred three million, fourteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •