Base | Representation |
---|---|
bin | 11110110000110101011… |
… | …010110100000111111010 |
3 | 21111002122200211122202211 |
4 | 132300311122310013322 |
5 | 234114003123200242 |
6 | 4255100100045334 |
7 | 305506250426011 |
oct | 36606532640772 |
9 | 7432580748684 |
10 | 2114020131322 |
11 | 745607285080 |
12 | 2a186509384a |
13 | 1244748b0ab8 |
14 | 74467947a78 |
15 | 39eccec5317 |
hex | 1ec356b41fa |
2114020131322 has 32 divisors (see below), whose sum is σ = 3641581644480. Its totient is φ = 910291783680.
The previous prime is 2114020131283. The next prime is 2114020131343. The reversal of 2114020131322 is 2231310204112.
It is a super-2 number, since 2×21140201313222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2114020131293 and 2114020131302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7722618 + ... + 7991674.
It is an arithmetic number, because the mean of its divisors is an integer number (113799426390).
Almost surely, 22114020131322 is an apocalyptic number.
2114020131322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2114020131322 is a deficient number, since it is larger than the sum of its proper divisors (1527561513158).
2114020131322 is a wasteful number, since it uses less digits than its factorization.
2114020131322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287886.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2114020131322 its reverse (2231310204112), we get a palindrome (4345330335434).
The spelling of 2114020131322 in words is "two trillion, one hundred fourteen billion, twenty million, one hundred thirty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •