Base | Representation |
---|---|
bin | 1100001101010001001110… |
… | …1100110011001010011001 |
3 | 1202112010210110100102210111 |
4 | 3003110103230303022121 |
5 | 3224401431421423001 |
6 | 44314010143244321 |
7 | 2553500142503350 |
oct | 303242354631231 |
9 | 52463713312714 |
10 | 13422103311001 |
11 | 4305311450870 |
12 | 16093632a96a1 |
13 | 76491167b2b8 |
14 | 3458c197c997 |
15 | 1842167b9851 |
hex | c3513b33299 |
13422103311001 has 8 divisors (see below), whose sum is σ = 16734050881344. Its totient is φ = 10458781800720.
The previous prime is 13422103310981. The next prime is 13422103311059. The reversal of 13422103311001 is 10011330122431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13422103311001 - 231 = 13419955827353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13422103314001) 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, 87156514930 + ... + 87156515083.
It is an arithmetic number, because the mean of its divisors is an integer number (2091756360168).
Almost surely, 213422103311001 is an apocalyptic number.
13422103311001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13422103311001 is a deficient number, since it is larger than the sum of its proper divisors (3311947570343).
13422103311001 is a wasteful number, since it uses less digits than its factorization.
13422103311001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174313030031.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13422103311001 its reverse (10011330122431), we get a palindrome (23433433433432).
The spelling of 13422103311001 in words is "thirteen trillion, four hundred twenty-two billion, one hundred three million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •